Key | Value |
---|---|
FileName | ./usr/share/doc/python3-toposort/changelog.gz |
FileSize | 697 |
MD5 | 11DEB705A0713950F7DFC21D8BAAC2E6 |
SHA-1 | E21C6005314D3E0848BAE078CA6EC63C3F25BB0D |
SHA-256 | E2DEED3DDDF6696BA0587859D6F260C6A81DD6E6F9D1F2CCBBE97B383B7FE67E |
SSDEEP | 12:XTZwqbXStJs2ftwtFvXig1XDtd3O3LzxUk8hJLA07XROVClHfCzsSdWUj:XtwqetfqthiqTt83LhYJkuplHfCARu |
TLSH | T1580199610C5BC161CA532A6297354672FB061E080D6805E9D489D5C936121F5C719A54 |
hashlookup:parent-total | 4 |
hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 7120 |
MD5 | 8AE45C5F0171F39A35949947AD7D86CE |
PackageDescription | topological sort algorithm - Python 2 module In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. . This package provides this algorithm for Python. |
PackageMaintainer | Luca Falavigna <dktrkranz@debian.org> |
PackageName | python-toposort |
PackageSection | python |
PackageVersion | 1.5-2 |
SHA-1 | 419DECD47E28CECF499608BF0D0DECEA8476075D |
SHA-256 | B55F5BD19A48D48F838A8E24665430106CCFB0624AFA15452E0AC0160F5EAC33 |
Key | Value |
---|---|
FileSize | 6796 |
MD5 | 9F891873875048A9D028709F0C2F3CD5 |
PackageDescription | topological sort algorithm - Python 3 module In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. . This package provides this algorithm for Python 3. |
PackageMaintainer | Luca Falavigna <dktrkranz@debian.org> |
PackageName | python3-toposort |
PackageSection | python |
PackageVersion | 1.5-1 |
SHA-1 | 32D6AFF433CFB3307C356C65A11BAD7BACADA7DA |
SHA-256 | AD8E53B64C0EF47039D18DD5FBB0B9881291BB5DA980627314717E30683E5604 |
Key | Value |
---|---|
FileSize | 7196 |
MD5 | F9B62BE75ED7D6A18C9C5C8869CD0616 |
PackageDescription | topological sort algorithm - Python 3 module In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. . This package provides this algorithm for Python 3. |
PackageMaintainer | Luca Falavigna <dktrkranz@debian.org> |
PackageName | python3-toposort |
PackageSection | python |
PackageVersion | 1.5-2 |
SHA-1 | 456F232A1F39E55AF29E47FC13F98CC224805EDA |
SHA-256 | 1C50A7F701E38BC7CE5232EDC9CC4509897512495588EA23E5A34D96EB954CD7 |
Key | Value |
---|---|
FileSize | 6706 |
MD5 | 316D08ACA7EF5814942C751C497DE0AA |
PackageDescription | topological sort algorithm - Python 2 module In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. . This package provides this algorithm for Python. |
PackageMaintainer | Luca Falavigna <dktrkranz@debian.org> |
PackageName | python-toposort |
PackageSection | python |
PackageVersion | 1.5-1 |
SHA-1 | 907ED6FAE2EA4E88EF449767B042851FFA97978E |
SHA-256 | F1321B6C0DC9F0E6B5B7394602ECB9461B944050807F9A304E91242F35B4D33D |