Key | Value |
---|---|
FileName | ./usr/share/doc/python3-toposort/NOTICE |
FileSize | 561 |
MD5 | 03699BB7D6DE02014BDBB10D07A2C487 |
SHA-1 | 35918720914355D1F05EE1CE09295CC7566CD34C |
SHA-256 | C69DD4051358659CC3A81C25080F4963763100AF4655B665E5D654AC9771E3D6 |
SHA-512 | DB392724AE5EE0BA9E2EE2D15B4F1FFD6DF4F3B4BFCCB4446DB37040A13428829D05347505801C42CAB6AB0482AAAEAFBA77E211656F91C9FBE3682CA0DB16BF |
SSDEEP | 12:JnI4IEGMFj27tYCQLU0E+9o/HQknd7Gps2A:G4IpxeU0E+4HQk1Gps2A |
TLSH | T1FBF0EB7D3E4027731BC0818B7E0F84CBA20AE5C8228F93881409C1E4013D16F55F81B0 |
insert-timestamp | 1636369304.1862414 |
source | snap:5NoKdGgaEwpoTglOFaFY4salgOMWUazt_6 |
hashlookup:parent-total | 6 |
hashlookup:trust | 80 |
The searched file hash is included in 6 parent files which include package known and seen by metalookup. A sample is included below:
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 |
---|---|
SHA-1 | 9FB0B972962BD6DDABF87F0A12AF73343A205D6F |
Key | Value |
---|---|
FileSize | 7620 |
MD5 | 70B3D17337E2B7DCEC63CEFEB986BA2E |
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.6-1 |
SHA-1 | CB6165B5F66BE6CD5D064379EE1AE9F34EEDF371 |
SHA-256 | 7FCC5ED59E7F772DC8E80C2B36E6ED3FB93D1DFDB111D0FE7059B9E2A71AB274 |
Key | Value |
---|---|
FileSize | 6868 |
MD5 | 550B22CFE271A6113E2310020AB6EF48 |
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.6-1 |
SHA-1 | 8760C6E5C6744E75330A985397F5010F4F462932 |
SHA-256 | 93A70F8F0DBC339B386EEF7002E8032189AAC03D5E1D17845653D2CAA8921832 |
Key | Value |
---|---|
FileSize | 6632 |
MD5 | 46CF35774130DC6036884FAA1D216662 |
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-3 |
SHA-1 | A2528F864F7789D8CA6C0A6924FAC09D6A044838 |
SHA-256 | FEA535AAE548943106B822059602327A3C51D4B53E4A9773AD6840A97E66504C |
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 |