Implements a topological sort algorithm
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.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.10-10.fc40 | - |
Fedora 40 | 1.10-10.fc40 | - |
Fedora 39 | 1.10-3.fc39 | - |
Fedora 38 | 1.10-1.fc38 | - |
EPEL 9 | 1.7-4.el9 | - |
EPEL 7 | 1.6-2.el7 | - |
You can contact the maintainers of this package via email at
python-toposort dash maintainers at fedoraproject dot org
.