| Key | Value |
|---|---|
| FileName | ./usr/share/doc/python-networkx-doc/html/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_edge_cut.html |
| FileSize | 25413 |
| MD5 | E449EDFC1BE174E8031429900B5176E4 |
| SHA-1 | 0057DC76F79FBB92E8C48275342C96EFCE79DBEC |
| SHA-256 | 6F6DED5F5CB25A9BC3CD95880B563730F8C6FF11ADCAD8A89A4F107EACDC0F64 |
| SSDEEP | 192:3ITDBbV54Dp/AxpvyWOqVzvZ+yLjqI26ocJpezvFL2tB/0+f2D4FpJunfdRbHup2:4TDB8RAK6jZ+XXRQnf3FjunfdRSi4aIk |
| TLSH | T15AB21F3208AA5573026342D45FDA3B2931C7596FE3662D62B2FC137987D2F90F60636E |
| 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 |
|---|---|
| FileSize | 9075880 |
| MD5 | AA14F9A8847B66C147597AB35CD81ADA |
| PackageDescription | tool to create, manipulate and study complex networks - documentation NetworkX is a Python-based package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. . The structure of a graph or network is encoded in the edges (connections, links, ties, arcs, bonds) between nodes (vertices, sites, actors). If unqualified, by graph it's meant a simple undirected graph, i.e. no self-loops and no multiple edges are allowed. By a network it's usually meant a graph with weights (fields, properties) on nodes and/or edges. . The potential audience for NetworkX includes: mathematicians, physicists, biologists, computer scientists, social scientists. . This package contains documentation for NetworkX. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | python-networkx-doc |
| PackageSection | doc |
| PackageVersion | 2.4-4ubuntu1 |
| SHA-1 | B5201BA5BA4CB399CF7A86A46229F7AC6979984C |
| SHA-256 | 3E4A534C36A5A4E3F119EEFB5D6A6234FC99447F980C38681176E9688D50351A |