| Key | Value |
|---|---|
| FileName | ./usr/lib/ocaml/ocamlgraph/graph.cma |
| FileSize | 3478088 |
| MD5 | FD5D9A2AFBA69DC49B000FD2EF339F31 |
| SHA-1 | 11E750D3FB8B68D40B4B7564E0B203E6936475B7 |
| SHA-256 | 2D551FB358355F98C53DF6C810A59C7B3EAAF76D5936E31EEE0387F70DE55DA3 |
| SSDEEP | 49152:QFWPu9nHum+/rbPq3FoNvj1Zqw9K/wfJwdYKo52iW8dUGU0vH9qXYmeZrFNcI7Gu:iYl9Ym |
| TLSH | T1EAF5610FB90707E1CC8D0ABD489901EF6A205A3CA1F74DBFC00D07E595A571EAB5A9DB |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | 4DF10DBA1E5FDE92EA09399931A2BAC9 |
| 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 | pterjan <pterjan> |
| PackageName | ocaml-ocamlgraph |
| PackageRelease | 3.mga7 |
| PackageVersion | 1.8.8 |
| SHA-1 | 1D213C16124C756ADEC6530B1243C239E8B462D5 |
| SHA-256 | 402460023754169E341BD7B281FD12E423E8D27B5E3A615810529F7E631F1EF4 |