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	894602
MD5	8403E25D10D804C2C737B4D656AC5F20
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b3
SHA-1	1C01611755A01DE723F8129D34C5901538C58014
SHA-256	233F2E5D6D10A09AC741199BBCA8975F2596054B742539579E47D8385E557B8D

Key	Value
FileSize	1243014
MD5	E99BDC73280E2F2C5CCD0784E6DE3237
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	7CA48203CEEA7830FB3094CFE16463D858E8C094
SHA-256	D641C8B3549D87884071190CCAAF0A3834226432683A61B59D949AA8E72CC8A2

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	894830
MD5	6B040B539474E924EFDBD59CDF40740F
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	E34888EDEB099A6D5CEF39ADA95E7CAAA8B4349A
SHA-256	311BD6D08250471F4DFACE3013775EF30288E1870DB870DBA6F5E07ADD3BAA24

Key	Value
FileSize	1209290
MD5	2A660CC872803060F63F680FA29DAB60
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	621DCDB777D31903D7B0C052A06BCFE20D22E5C4
SHA-256	D053B7859B4227913F33C38C8E41AC54F5CDC73DD8F33B967AC3AC4897C5911C

Key	Value
FileSize	894674
MD5	F02AD5473D6FB290D8183C73F47029BB
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	88043FC7DE3FF1E2093FCF257D2F218E3F8E709E
SHA-256	CAC2D271A5239EBBECB357672F71F125DABA715D2F80725D3336FE5DDEF697CA

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	1176324
MD5	5CDA93544C865F62B9DFFBFB7EF118C2
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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1build2
SHA-1	9132B88BA925663BA433D331337D50B9214644B5
SHA-256	818A71EFA9622F62A97C3BE385DCE7C4D8E14DB0349AE0FF05E89108BC8E0EF2

Key	Value
FileSize	1184050
MD5	B6E5B00BCC0B56B0B6469F3789D45B71
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	599E71375DDA42BCA1274F02079F0E0D8810C47F
SHA-256	DD851EEB1F188C762B72B89F1587EF44A3C2FD04FD547237C55E613BB724E967

Key	Value
FileSize	894674
MD5	F1C09032F66CDABBCEE537B3280D1584
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	94E914FCD093BCB4BC42C3F79F06A793BC285918
SHA-256	195251892E75D1ACA6D19A7322288DFFFE83F92055E96999CEC47E7DB5106096

Key	Value
FileSize	895114
MD5	BD354546CE59E93FF5CE6809221274DB
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b3
SHA-1	9BE0EEE425C259EC6D73A854A56649833CC4BE20
SHA-256	8A6ACE787A615CE606A1BCA09D39166FDC67FC70A2ADA068045F871CC4E51063

Key	Value
FileSize	1300674
MD5	0DB296A8D3BC0AC59B26B4E8DBDA2938
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	4B799C476E3CA1893C9840154223095238E8A228
SHA-256	C90711E7EFDB4C79D4F32EBB8DBCE2722B7EC401DDC1562BA4491B275B630DF1

Key	Value
FileSize	1196162
MD5	DC3CCD4842948B17256E542BB62DFC58
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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1build2
SHA-1	8E602CBA4E59FB586CA1652ED60C6388EF2CEA74
SHA-256	B3ECEDF60C600E4C87A5C9FC6D0E2FD70E163FE7B4EBAA532014097F9FBCA09A

Key	Value
FileSize	1314718
MD5	6DCA91B055B236BA4F78D29850054CF9
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.
PackageMaintainer	Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
PackageName	libocamlgraph-ocaml-dev
PackageSection	ocaml
PackageVersion	1.8.6-1+b2
SHA-1	B277B1FBA1269C48366869B8C21E68992682CA55
SHA-256	49A3A7E8E0C77DFA2717191DBAAC78E7A7532743CF23D92736C9DC2F5CC83C26