Home  Trees  Indices  Help 



object +  DependencyGraph
Dependency Graph Container
This is a simple directed acyclic graph. The graph starts empty, and new nodes (and edges) are added using the add method. If the newly added create a cycle, an exception is thrown.
Finally, the graph is resolved using the resolve method. The method will return topologically ordered nodes and destroy the graph. The topological order is stable, meaning, the same graph will always produce the same output.
Instance Methods  




list 


Inherited from 
Properties  
Inherited from 
Method Details 

Add a new nodes with edge to the graph The edge is directed from

Resolve graph and return nodes in topological order The graph is defined by outgoing and incoming dicts (mapping nodes to their outgoing or incoming neighbours). The graph is destroyed in the process.

Home  Trees  Indices  Help 

