Toposort
Toposort
https://bitbucket.org/ericvsmith/toposort
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.
Licensing
License
Verified by
Verified on
Notes
License
Verified by
Debian: Luca Falavigna <dktrkranz@debian.org>
Verified on
24 July 2014
Notes
License: apache-2.0
Leaders and contributors
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Debian (Ref) | https://tracker.debian.org/pkg/toposort | |
| Download | https://bitbucket.org/ericvsmith/toposort | |
| Python (Ref) | https://pypi.org/project/toposort |
Software prerequisites
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.