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 42 | 1.10-13.fc42 | - |
| Fedora 41 | 1.10-12.fc41 | - |
| Fedora EPEL 9 | 1.7-4.el9 | - |
You can contact the maintainers of this package via email at
python-toposort dash maintainers at fedoraproject dot org.