Topologicalsorter
- 1 add method of topologicalsorter in Python The add() method adds a node and its predecessors to the graph. The graph should be a DAG for the sorting to work. 23 Jul 2021
- 2 done() method of the TopologicalSorter class in Python The done() method of the TopologicalSorter class, marks the vertex of a DAG as visited. 27 Jul 2021
- 3 get_ready() method of Topologicalsorter in Python The method get_ready() returns the nodes that can be visited in a DAG. The Python example prints the topological ordering for a version tree using two worker threads and a main thread. 27 Jul 2021
- 4 TopologicalSorter of graphlib in Python The class TopologicalSorter of graphlib sorts the nodes of a given DAG in linear order. The DAG can be passed as a Python dictionary or it can be constructed using the add() method. 23 Jul 2021