Result for 197273788EA72F153FA074FD8792A76F9ECE4938

Query result

Key Value
FileName./usr/share/licenses/ocaml-ocamlgraph/LICENSE
FileSize27534
MD5BA3525A68C09A5C9EA76D9C29D3C41C5
SHA-1197273788EA72F153FA074FD8792A76F9ECE4938
SHA-256E9684FF81666D63A1746F6B3F0D904DB100D092FB4F15032EA4FDC0B89762E4D
SHA-5129F8B500974E6D0FF49FA0AA12C3784A1D9653B1F1A2D79004DA270FDD7367E4AD724535BF9FEEEF15263A42C5FB019431529B64090C580B2DE6FE39827F82935
SSDEEP384:FOBJyb5sOuAbnnkURSX6wFDVxnFw7xqsvzt+z3k8E9HinIhFkspcMtxc7ups0C7o:FTb53rLSDnFMz1ReScMc7Gsh7uQY
TLSHT1E8C2843EB70103B206C206905A4FA4DEA32BD07932675E6474DDC15D23AB93543FBBEA
insert-timestamp1727037182.1045918
mimetypetext/plain
sourcesnap:o6VxNjysVdkpKBde54Vb4BDJdEbcsGpT_34
hashlookup:parent-total100
hashlookup:trust100

Network graph view

Parents (Total: 100)

The searched file hash is included in 100 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
MD57B2EBC9138144869ED04CA5011E89A70
PackageArchx86_64
PackageDescriptionOCamlgraph is a graph library for Objective Caml.
PackageNameocaml-ocamlgraph
PackageRelease16.d_l_ocaml.8
PackageVersion2.0.0
SHA-10A6B133AD591104D58F29552571017F7C4DDDB55
SHA-256ABA7205F45A730571A8E0E2D1F9866990E1655EE89D461424323CF34AD6FF9BA
Key Value
MD5A4D31B1C6F271F4E0ECEE6BFD79F0E77
PackageArchi586
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
PackageRelease4.mga9
PackageVersion2.0.0
SHA-10C6D88F49D5A268CEC58946B3FC0590BBEE5D3FE
SHA-25652FBEA47894186EAD43AD6C06FA5162158DA5F6C423CE2A62F5A99FBC15A8C82
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
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
MD510D13E51F0F3BF16C1A97E254FD9CBC7
PackageArchppc64le
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
PackageRelease3.fc23
PackageVersion1.8.6
SHA-11681F819860DE1FDA6BA9CA4E9F3F9DE832899BB
SHA-2568398BDD8F22ECE0F80A1B643B32BDC1F39C7716D80ECC5BDC2F9C8C5F1306D73
Key Value
SHA-1198D3BB17C0DA24D5E7AB88D549B081076EC2C79
snap-authoritycanonical
snap-filenameo6VxNjysVdkpKBde54Vb4BDJdEbcsGpT_28.snap
snap-ido6VxNjysVdkpKBde54Vb4BDJdEbcsGpT_28
snap-namecoq-prover
snap-publisher-idoMbd0RvRzHHCiinUSnIQdNjIWf2vCHRJ
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-02-26T01:53:46.711754Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/o6VxNjysVdkpKBde54Vb4BDJdEbcsGpT_28.snap
Key Value
MD5D80435B60239A9CFEDB6CDA1E39A7D18
PackageArchppc64
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
PackageRelease3.fc21
PackageVersion1.8.5
SHA-119DE89CDB46318AD5FFB9118C056FCDCB87A31B0
SHA-2562FCC59C62261E55076936FCB50468E03E3F9FB8645F15BC4C540287D7473B33D
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