2.1.3.1. `DirectedAcyclicGraph`¶

class Valentina.Graph.DirectedAcyclicGraph.DirectedAcyclicGraph[source]¶

Bases: object

add_edge(ancestor, descendant)[source]¶

add_node(node_id, **kwargs)[source]¶

leafs()[source]¶

roots()[source]¶

topological_sort()[source]¶

class Valentina.Graph.DirectedAcyclicGraph.DirectedAcyclicGraphNode(node_id, data=None)[source]¶

Bases: object

ancestor¶

breadth_first_search()[source]¶

connect_ancestor(node)[source]¶

data¶

descendants¶

disconnect_ancestor(node)[source]¶

is_leaf¶

is_root¶

node_id¶

Read the Docs v: latest

Versions: latest

Downloads: htmlzip

On Read the Docs: Project Home; Builds

Free document hosting provided by Read the Docs.