10.1.1.4.1. DirectedAcyclicGraph

This module implements a directed acyclic graph.

class Patro.Common.Graph.DirectedAcyclicGraph.DirectedAcyclicGraph[source]

Bases: object

Class to implement a DAG.

__getitem__(node_id)[source]
__init__()[source]

Initialize self. See help(type(self)) for accurate signature.

__iter__()[source]
add_edge(ancestor, descendant)[source]
add_node(node_id, **kwargs)[source]
leafs()[source]
roots()[source]
topological_sort()[source]
class Patro.Common.Graph.DirectedAcyclicGraph.DirectedAcyclicGraphNode(node_id, data=None)[source]

Bases: object

Class to define a node of a DAG.

__init__(node_id, data=None)[source]

Initialize self. See help(type(self)) for accurate signature.

__repr__()[source]

Return repr(self).

ancestor
connect_ancestor(node)[source]
data
descendants
disconnect_ancestor(node)[source]
is_leaf
is_root
node_id