Lines Matching refs:graph
28 exist in the working graph.
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
42 """Provides functionality to topologically sort a graph of hashable nodes"""
44 def __init__(self, graph=None):
50 if graph is not None:
51 for node, predecessors in graph.items():
60 """Add a new node and its predecessors to the graph.
69 is included among *predecessors* it will be automatically added to the graph with
87 """Mark the graph as finished and check for cycles in the graph.
91 progress. After a call to this function, the graph cannot be modified and
159 graph by using "add" or if called without calling "prepare" previously or if
239 order in which the items were inserted in the graph.