Parents (Total: 15)

The searched file hash is included in 15 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	92706
MD5	4529E2268BBB0DF85FF3E5915BC07ACE
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b3
SHA-1	86F65484F63A8390BAA5CAF6918C0190FD80CDFA
SHA-256	D3F607CF0EBA9071B30CB6B4FEDE459B4AFB04FFA91C837E3056252D0A5670F0

Key	Value
MD5	275449F975E17C31ECC188E2C2F523BC
PackageArch	aarch64
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc23
PackageVersion	1.8.6
SHA-1	D2398B55FF0F66E66EEC3352D57B975BD02AAED5
SHA-256	07228C343AA926CB2F389A4A1659988675B4BC9E05D5F6DEC612039A6B5D8FC2

Key	Value
MD5	5780352DE868490E67C6F745FEBBA823
PackageArch	ppc64
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc23
PackageVersion	1.8.6
SHA-1	585EAD9C43C8BDA0B1C36DF1323F00B74003774A
SHA-256	94B5999145F4345EE087D737EC7693868FC072ED8CFDD755F8D0E1896249A4A9

Key	Value
FileSize	209306
MD5	B79055DE506CB9BC773ADBD7812AB5B8
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	2F25B033AF48BEE3DE2B28CFD19F64B18DD1AB41
SHA-256	1526B6E72C7E41ACC58BC0657FA2C6FB4B3E2D8C8CCDB0B7388D1EEA321EB1D3

Key	Value
FileSize	176164
MD5	691C65E792129C24DA31367FF00FAAC4
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1build2
SHA-1	0ACED5B4A5F7B218FBDFE7D98041346E94601283
SHA-256	97F7FA7CB31A031952321ACDFE953A40EEA36AF82DB8D182ABC7DD88C18FB84F

Key	Value
FileSize	200476
MD5	2C8D9E8961543776C36CDA9BCD99021F
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	77E3113B4FED8CC980B62E75997F085E39110ED7
SHA-256	8D6A182EA106186B75F406C8B78AC625BB57CEA0331AE3AFAD57EB66D6640240

Key	Value
FileSize	185228
MD5	03125ECE16F0AA2F9258A91826BDEB4F
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	FBEA4B046F4C3C1AF6D11239ED02604C6435611B
SHA-256	037B587C712448D40EE831DF882C2D18C4E44B38FAB2B78497ACF997F88DF4D9

Key	Value
MD5	10D13E51F0F3BF16C1A97E254FD9CBC7
PackageArch	ppc64le
PackageDescription	Ocamlgraph provides several different implementations of graph data structures. It also provides implementations for a number of classical graph algorithms like Kruskal's algorithm for MSTs, topological ordering of DAGs, Dijkstra's shortest paths algorithm, and Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms and data structures are written functorially for maximal reusability. Also has input and output capability for Graph Modeling Language file format and Dot and Neato graphviz (graph visualization) tools.
PackageMaintainer	Fedora Project
PackageName	ocaml-ocamlgraph
PackageRelease	3.fc23
PackageVersion	1.8.6
SHA-1	1681F819860DE1FDA6BA9CA4E9F3F9DE832899BB
SHA-256	8398BDD8F22ECE0F80A1B643B32BDC1F39C7716D80ECC5BDC2F9C8C5F1306D73

Key	Value
FileSize	92684
MD5	F690198E169F71DF88C445B8ACD03DA2
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	DD367A44841449BF90A370C74FCE9C04D690CDAE
SHA-256	62CEB8545253680F27FC3F753783DE1301C73E5A33C00C55F98FA95892965846

Key	Value
FileSize	92706
MD5	49E2D678A950419F98CF28836C289001
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b3
SHA-1	C5C2B189FE890491E512B1116EEA8FE29F4347B2
SHA-256	05EB6B10BFD033933050903ADA44466A0876C224D3DF96FD716C953A12C3EDD6

Key	Value
FileSize	175254
MD5	C8B7AFB720ED8B592C6EF1F0E0E28B51
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1build2
SHA-1	B57AF920E9B69C02A03762DC709727C8F4835D84
SHA-256	22206FCF7717DAA6ABED04FA09AECFF1DADEAB51CD792266CF593804D0F6DE9B

Key	Value
FileSize	92690
MD5	C601B586ECEB66EEF42C00D3DAB60CF6
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	FEF6BD62363AFC0C6D43F61D9B980C387D27438A
SHA-256	DD73EF18573DAA7E5AAEB59F4BBA9913F3F6BDC644E2353EB93931CA6B231C57

Key	Value
FileSize	92694
MD5	8DBE02E52E6C0C1833190C8911729312
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	F5047042FE1B5EF2E32A1AFA1BAC8194D95303DA
SHA-256	5844AFAE1CE3D8F63D152B2F1ECA9BF8D8B135D48361B3729C157C65CF4CDF3C

Key	Value
FileSize	194514
MD5	824C2F8C2A7F53DA954BADCD74E8593A
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	BD7D4642C2F9E1FB2672F13C2EAD1B27128027F9
SHA-256	5FC758EB59F8A4627821EF036D44CA2B4859786951443A32CA2D79452615A2F6

Key	Value
FileSize	184696
MD5	9DF5DB010A404AEDAB26AA25A3E69F2D
PackageDescription	graph library for OCaml Ocamlgraph is a graph library for OCaml. Its contribution is three-fold: . * It provides an easy-to-use graph data structure together with several operations and algorithms over graphs. It is a reasonably efficient imperative data structure for directed graphs with vertices and edges labeled with integers. . * Then ocamlgraph provides several other graph implementations for those not satisfied with the one above. Some are persistent (imutable) and other imperative (mutable). Some are directed and other are not. Some have labels for vertices, or labels for edges, or both. Some have abstract types for vertices. etc. These implementations are written as functors: you give the types of vertices labels, edge labels, etc. and you get the data structure as a result. . * Finally, ocamlgraph provides several classic operations and algorithms over graphs. They are also written as functors i.e. independently of the data structure for graphs. One consequence is that you can define your own data structure for graphs and yet re-use all the algorithms from this library -- you only need to provide a few operations such as iterating over all vertices, over the successors of a vertex, etc. . This package provides viewgraph and dgraph library to build graph viewers.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-viewer-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	8D962433DBF09973017AD2C074294527505EC713
SHA-256	9A7A79069C8D45D02A4CF3327F99C90ECC143A8BE9DD109FD77E255AE773A6B1