Result for C89E39160FCFDB50B0C448FF8D3E07043122E2DE

Query result

Key Value
FileName./usr/lib/ocaml/ocamlgraph/META
FileSize675
MD5AA1B8982CBCEF547703ED0682BC032CF
SHA-1C89E39160FCFDB50B0C448FF8D3E07043122E2DE
SHA-256400CA5BCA32C3B373F83C012170CC1E145F3D49B6FD32611BE861B50669D61C8
SSDEEP12:ZmlrYFlJ5zxeA5zJlfIBYRyoPAfMxB2BrYFNzxzVuBIVqyoPc7fMxB2BrYWVpNzT:ZcMDzxe6zJ5H5PArBmNzxzVUPWrB7DNX
TLSHT15801F9345B6C9255688AC06C3C1D06C97DEAD2F414D3A58DF2A382495E1C84FD3E7432
tar:gnamebin
tar:unameroot
hashlookup:parent-total85
hashlookup:trust100

Network graph view

Parents (Total: 85)

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

Key Value
MD5A9ABB9F60469051331BCD53AE1E62717
PackageArchx86_64
PackageDescriptionOcamlgraph 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.
PackageMaintainerFedora Project
PackageNameocaml-ocamlgraph
PackageRelease15.fc32.1
PackageVersion1.8.8
SHA-1014736414F93182EDFA5AC9744CA07084E3D3667
SHA-2560FDFE2AF57D0101DA8FA32A52BF2DEBE051AD7AC0DC2D9A1419936FFBF662537
Key Value
MD56AA44A65918E831C6A03D6B7A6FF3D69
PackageArchx86_64
PackageDescriptionOcamlgraph 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.
PackageMaintainerpterjan <pterjan>
PackageNameocaml-ocamlgraph
PackageRelease7.mga8
PackageVersion1.8.8
SHA-106BAA5D9D59E622CA63A39C5BF081532F7A7E364
SHA-25645C883ECC4D2ABC760F52197F2697D9169B9F484C79286C42BAF8666D3E00662
Key Value
MD5741AA41A18D76737FE06689ECBE46AB4
PackageArchx86_64
PackageDescriptionOCamlgraph is a graph library for Objective Caml. This package contains development files for ocaml-ocamlgraph.
PackageMaintainerhttps://bugs.opensuse.org
PackageNameocaml-ocamlgraph-devel
PackageReleaselp150.1.1
PackageVersion1.8.8
SHA-111912612E28EA19ABF8AB5297F4EBBB7CCAA6AC8
SHA-256BCBD12CB6DF6F30DB142DC32286E1BF1B9EE5F08C62862732C0C48BEF9A9E727
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.5/packages//sparc64//ocaml-graph-1.8.8.tgz
MD53C63DE010F22E65368B00A55457BD77B
SHA-111A44C47C00E1E064DBAEADC58DFA06AFE2A972F
SHA-2561703828A5EA92647C9D22A3B634D356FDAB4B64F112CA8E01887B4980EF3BE22
SSDEEP393216:YTGO05WDVXHOBfGiTvin4CDjsIPPQ9xAr:gGhCexC4CDjtnII
TLSHT1C0C633E4D1C3B16AFFD086E1E15FD06200B7D652703183D97312A2A65FAEBDD1ABE106
Key Value
MD5F5B08D0396A41378DFDF0ADADC51F1B9
PackageArcharmv7hl
PackageDescriptionOcamlgraph 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.
PackageMaintainerpterjan <pterjan>
PackageNameocaml-ocamlgraph
PackageRelease7.mga8
PackageVersion1.8.8
SHA-114B6AAF27E7B151FDF8FF9FBAD63CB7267F9DC64
SHA-2560047DD4EA8960144C601AD803AC429CF00C69B5D886BE1E6AADCDC2095C1E1B3
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//i386//ocaml-graph-1.8.8p2.tgz
MD5DF3C0175881B75215ECEDEED1C6D974A
SHA-11556A4639F936F70116B8BE343A43D300D7FE353
SHA-25611C5FDAA882FAB9C573D2607952ADA02A4964D8BA0E285084A779D88AA7203BC
SSDEEP393216:AONyaGaSyE1h/9yqH9zRLlExpEn3LEiBJt1h+XW30Uq6:lKyEMqHPLyGbEijO3v6
TLSHT1C50733540E79F398C9F7C0A48B6C9D789F50F78695B1BAF990CCF7280610CA27D60EA5
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.4/packages//amd64//ocaml-graph-1.8.8.tgz
MD5F5C2C164DB037B1C18BF3495BF3FE168
SHA-1168D4366640629175809059AE93DD0B8061C5240
SHA-2568733537C123812ADA3C3F87BDB6F03875481B107E937FE273940A51FB3055F30
SSDEEP393216:f8gPJgZjq7YIBSmVKBcmnPXIX39VYg2vZpoWK0mDhAzyeB+gT:R4jkB7VKBZnPXO35M2WK7hQDBhT
TLSHT12AE63376B0800F43382ACAF2D6CEE6D5E654209E679376A1DD6844D7F80E0EB4967C73
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.3/packages//sparc64//ocaml-graph-1.8.8.tgz
MD5AE715B7DEF7994D55D8F1A86B3EB7D35
SHA-118CE45DB45804E6082799E9E6A60421E6F1048BE
SHA-2568CF262B65B3DDBC6AECF984EAD268D0B10F8A48CB04FBEE966D5B045BF0C0455
SSDEEP196608:GmOEuGWBpTvUKTIgvQWCC/nKSyMthCF25sSc7v8BbMGMgw/iFpgOprrJSkg98B/:GmO/GmTCt7qnKnICuLMGBw/iFpr4kg0
TLSHT16EB633F36158A9C68445D7B1E16E85EC55E0B298E876C62BD45C1F1D2FEE2E02EF080F
Key Value
FileNamehttps://ftp.lysator.liu.se/pub/OpenBSD/6.3/packages//amd64//ocaml-graph-1.8.8.tgz
MD5B4671DFD1A8DA2D48C027DDF62F5DDFC
SHA-11AF09FE70D0CFA357AB81126F03042E81775FE30
SHA-256A450C166B9CC3BB955646FE6DC82041F41855B54474D25ECC2288EFF1E8E3917
SSDEEP393216:/fhCQ3pNTX7UTGP3Ea1Cc6W8oek/ycqO++b:nwQ5qTyE788zPW
TLSHT162E633E424EA9FC641876DB4D712E85BFF9230CEAA2381CBC5E8016C3D550FD96A2573
Key Value
MD54DF10DBA1E5FDE92EA09399931A2BAC9
PackageArcharmv7hl
PackageDescriptionOcamlgraph 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.
PackageMaintainerpterjan <pterjan>
PackageNameocaml-ocamlgraph
PackageRelease3.mga7
PackageVersion1.8.8
SHA-11D213C16124C756ADEC6530B1243C239E8B462D5
SHA-256402460023754169E341BD7B281FD12E423E8D27B5E3A615810529F7E631F1EF4