all_topological_sorts(G)
A topological sort is a nonunique permutation of the nodes such that an edge from u to v implies that u appears before v in the topological sort order.
Implements an iterative version of the algorithm given in [1].
A directed graph
Returns a generator of _all_ topological sorts of the directed graph G.
a list of nodes in G, representing one of the topological sort orders
To enumerate all topological sorts of directed graph:
>>> DG = nx.DiGraph([(1, 2), (2, 3), (2, 4)])See :
... list(nx.all_topological_sorts(DG)) [[1, 2, 4, 3], [1, 2, 3, 4]]
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.dag.all_topological_sorts
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them