Definition at line 1 of file graph.py.
◆ __init__()
def graph.Graph.__init__ |
( |
|
self | ) |
|
◆ add_edge()
def graph.Graph.add_edge |
( |
|
self, |
|
|
|
first, |
|
|
|
second, |
|
|
|
orientation = 0 |
|
) |
| |
Add edge from first to second. Also add edge from second to first if orientation
is null.
Definition at line 22 of file graph.py.
◆ add_node()
def graph.Graph.add_node |
( |
|
self, |
|
|
|
q = None , |
|
|
|
new_connex = False |
|
) |
| |
Create the memory to store a new edge. Initialize all components to None.
Create an empty list of children.
Definition at line 9 of file graph.py.
◆ connexIndexes()
def graph.Graph.connexIndexes |
( |
|
self, |
|
|
|
connex |
|
) |
| |
Return the list of all node indexes belonging to connex component <connex>.
Definition at line 52 of file graph.py.
◆ new_connex()
def graph.Graph.new_connex |
( |
|
self, |
|
|
|
idx |
|
) |
| |
Create a new connex component for node <idx>
Definition at line 33 of file graph.py.
◆ rename_connex()
def graph.Graph.rename_connex |
( |
|
self, |
|
|
|
past, |
|
|
|
future |
|
) |
| |
Change the index of the all the nodes belonging to a connex component.
Useful when merging two connex components.
Definition at line 41 of file graph.py.
◆ children
◆ connex
◆ existing_connex
graph.Graph.existing_connex |
◆ nconnex
The documentation for this class was generated from the following file: