python3-toposort - 1.9-1 main

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.

Priority: optional
Section: python
Suites: amber byzantium crimson dawn landing 
Maintainer: Luca Falavigna <dktrkranz [꩜] debian.org>
 
Homepage Source Package
 

Dependencies

Installed Size: 28.7 kB
Architectures: all 

 

Versions

1.9-1 all