Key | Value |
---|---|
FileName | ./usr/share/doc/python3-toposort/copyright |
FileSize | 1005 |
MD5 | 34D94C065D3E1AFA41B5199BC9797672 |
SHA-1 | 59A930B180A72192AEB91232232176D427D65DC2 |
SHA-256 | 33DCCC21EA3FFA097CECF0DAF36EB30A65EE79AC678944614C76D20BC39B8724 |
SSDEEP | 24:gtthccq04ITRkU0E+ohzHQk18ps+YnAyUhnm5:eq04OX0ehzH31cSnxU45 |
TLSH | T11C11657DB9014A3363D0D4C2BE2AD0CFE707A284645E93F540484291953836B02E81A0 |
hashlookup:parent-total | 3 |
hashlookup:trust | 65 |
The searched file hash is included in 3 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 | 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 | 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 |