edgegraph.sorting.toposort#
Algorithms for topological ordering of graphs.
This module provides a topological sorting / ordering capability, allowing ordering of graphs based on their dependent vertices. Most commonly, this is useful for dependency calculation.
See also
Descriptive documentation about what solvers are implemented can be found here: Topological Sorts.
Functions
|
Provide a topological ordering (sort) of a given universe's vertices. |