Key | Value |
---|---|
FileName | ./usr/share/doc/python3-toposort/copyright |
FileSize | 998 |
MD5 | D02034B2CF116616916A622A68C1DE64 |
SHA-1 | 52BE7F2479526FFEC975AAF28CD5B26417970D4E |
SHA-256 | D50F54763219308596302C757FE01D39084D5F85516AAD3E404DCC583A13DB73 |
SSDEEP | 24:g0thccq24ITRkU0E+ohzHQk18ps+YnAyUhnmh:Lq24OX0ehzH31cSnxU4h |
TLSH | T1D711217DBA458A7363E0D5C2BE2AD0CFEB07A284655E93F590494691993836B02E81A0 |
hashlookup:parent-total | 8 |
hashlookup:trust | 90 |
The searched file hash is included in 8 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 5424 |
MD5 | 0510ED54656EB93D53EB42DBEED28515 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python-toposort |
PackageSection | python |
PackageVersion | 1.4-1 |
SHA-1 | C64AB025030EDDBDBD71B5894816AC586F83608A |
SHA-256 | 8AAFBEF30E2CFF3CCC01DB7532DFDACE07BC0A85B40167EA16919F62227C4684 |
Key | Value |
---|---|
FileSize | 6008 |
MD5 | 26766FAE7FFB497EACA5021BCD380DF6 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python-toposort |
PackageSection | python |
PackageVersion | 1.5-1 |
SHA-1 | D01A55FE7E883CEE1F00486C6EFBD1E193D9B7B8 |
SHA-256 | FEBEB377458205579279109DCE5A6AC042327B895C177AA9986C2B01C5B21AAD |
Key | Value |
---|---|
FileSize | 5496 |
MD5 | E91F5F6EC100D865702B7AEF9D3970BB |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python3-toposort |
PackageSection | python |
PackageVersion | 1.4-1 |
SHA-1 | 9897492C67236A39A96F499E6D032238F2ADA7E4 |
SHA-256 | A82D156181566A266DE5D33601F9DE32AA7B12371E99B84A03360D0C314D1665 |
Key | Value |
---|---|
FileSize | 6426 |
MD5 | 694D39094AE53E61F75FC390F4E5AF9C |
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.1-1 |
SHA-1 | 159C60B4F181D2300F99B0A751D467B2B72E0EAA |
SHA-256 | C1D9C4E826868495175B10C718CE5CA2F162AA0B49F7FE89C4AD4E611C5186E8 |
Key | Value |
---|---|
FileSize | 6500 |
MD5 | F1C0C09BF3F1075F4D0E7511C18B4EC1 |
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.1-1 |
SHA-1 | C333DA8D83F9DB9D5ADD5AFC8BB61B2B7AD839AB |
SHA-256 | A57F98D61AC3A93D5A7A35BBED1D8DA90C49B582E3EE986923F25646F1E3869A |
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 | 6090 |
MD5 | A31A0BF01E501A9AAD3D59ECE4AD25FB |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | python3-toposort |
PackageSection | python |
PackageVersion | 1.5-1 |
SHA-1 | 20EB2D4FBFD5BDBC40E9A4BD72B3D54FDDD32F23 |
SHA-256 | 605DC640EC3D846CDEF585D543B9804720AC8C36FC21F9DF1BEA6B8EBBA1C6DF |
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 |