| Key | Value |
|---|---|
| FileName | ./usr/share/doc/ocaml-ocamlgraph/CREDITS |
| FileSize | 158 |
| MD5 | 03EF9EF9AC8AE2D72A3C698C510BB8E8 |
| SHA-1 | 81AE403C9866841AE8496C3A8020633BBDF2EACF |
| SHA-256 | 1B216BF31E127865FCFEDBF407E28D77F5F7998241BFFF6DD9513CFD8754CCBF |
| SSDEEP | 3:cHC4OWgFMWfVAELIUsgj0nmvFqUQ/oISAudAl6YAQM7:h4OWgFMgAilbj0JVo53dAgt/ |
| TLSH | T1B1C08C47361A81000EA7C989C0B69C217708E07A090635A694EBB7387744B600B3C980 |
| hashlookup:parent-total | 37 |
| hashlookup:trust | 100 |
The searched file hash is included in 37 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | A9ABB9F60469051331BCD53AE1E62717 |
| PackageArch | x86_64 |
| 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 | 15.fc32.1 |
| PackageVersion | 1.8.8 |
| SHA-1 | 014736414F93182EDFA5AC9744CA07084E3D3667 |
| SHA-256 | 0FDFE2AF57D0101DA8FA32A52BF2DEBE051AD7AC0DC2D9A1419936FFBF662537 |
| Key | Value |
|---|---|
| FileSize | 4479576 |
| MD5 | ED8C911D1AA848FFF287DDC890C83030 |
| 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 | 2.0.0-2 |
| SHA-1 | 0B3D0ECCC39FAFD2E238C816932162E05D5B5F99 |
| SHA-256 | 15DC9E87583427B2E38359BE7C6EC9FD914EAE3A74EB24364A7976B0CFA577A3 |
| Key | Value |
|---|---|
| FileSize | 4469476 |
| MD5 | A50645153D88BD78A6237C937A3F19C7 |
| 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 | 2.0.0-2 |
| SHA-1 | 0D8EECDC38459AC897835C58A95762B3F071254F |
| SHA-256 | 2E6EB4CA486B6659CC84D734531BB91C13DAD61C4FA1CB5A6B30A92CA21B3E6F |
| 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 | 4496808 |
| MD5 | 19431D84ECB117C59D4E4B1F4DC127A2 |
| 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 | 2.0.0-2 |
| SHA-1 | 18E50B31E2B1A92959050A3E66880CE08259E386 |
| SHA-256 | 16CF6F34E2358CF4770386D6D4A2AEF8C10189C0BC1B8F78ADEE56EC94BB5CDA |
| Key | Value |
|---|---|
| MD5 | D80435B60239A9CFEDB6CDA1E39A7D18 |
| 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.fc21 |
| PackageVersion | 1.8.5 |
| SHA-1 | 19DE89CDB46318AD5FFB9118C056FCDCB87A31B0 |
| SHA-256 | 2FCC59C62261E55076936FCB50468E03E3F9FB8645F15BC4C540287D7473B33D |
| Key | Value |
|---|---|
| MD5 | E74557858C292C6446DE70E7521C590C |
| 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 | 15.fc32.1 |
| PackageVersion | 1.8.8 |
| SHA-1 | 23FCEBA0CC660053EC823C1A8080B2C753568A2B |
| SHA-256 | EC4A070F2D85E092A08946F519968EA9D97B9E1D4EA15C72D179B4C8F841110A |
| Key | Value |
|---|---|
| MD5 | E4EC98E98EEAF85404836CE33858D749 |
| PackageArch | armv7hl |
| 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 | 1.fc19 |
| PackageVersion | 1.8.3 |
| SHA-1 | 307BE174B85459A542A779E82F6D9A37847570D1 |
| SHA-256 | 806C2C86FCCBC9FE9E5B49831DC00C1E2EA2F70C7F578D3F1F516D32993D233E |
| Key | Value |
|---|---|
| MD5 | F1C1A596490A9A4E07FF1D1823A0AD3A |
| 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 | 1.fc19 |
| PackageVersion | 1.8.3 |
| SHA-1 | 435A8E4F2A25362515744DF1E223E3B6A6551469 |
| SHA-256 | 8634035E21061C0E97865A561755EF9E0BDC33A82C83D2D2B17A3BDFB50D8223 |
| Key | Value |
|---|---|
| MD5 | 3F93016D2F868FA049847E37B907633A |
| PackageArch | armv7hl |
| 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 | 15.fc32.1 |
| PackageVersion | 1.8.8 |
| SHA-1 | 44626B828B1674AE1FC2A89E86E506CBF28AD6BE |
| SHA-256 | E6A6FA1AF29C03AE6C9BE4797DBD4A5223DF7C1B30CE08B297249CC8B7922ADA |