Public Member Functions
	__init__ (self)
	add_edge (self, first, second, orientation=0)
	add_node (self, q=None, new_connex=False)
	connexIndexes (self, connex)
	new_connex (self, idx)
	rename_connex (self, past, future)

Public Attributes
dict	children = {}
list	connex = []
list	existing_connex = []
int	nconnex = 0
list	q = []

Detailed Description

Definition at line 1 of file graph.py.

Constructor & Destructor Documentation

◆ init()

__init__ ( self )

Definition at line 2 of file graph.py.

Member Function Documentation

◆ add_edge()

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()

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()

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()

new_connex	(		self,
			idx )

Create a new connex component for node <idx>

Definition at line 33 of file graph.py.

◆ rename_connex()

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.

Member Data Documentation

◆ children

dict children = {}

Definition at line 3 of file graph.py.

◆ connex

connex = []

Definition at line 5 of file graph.py.

◆ existing_connex

list existing_connex = []

Definition at line 7 of file graph.py.

◆ nconnex

nconnex = 0

Definition at line 6 of file graph.py.

◆ q

list q = []

Definition at line 4 of file graph.py.

The documentation for this class was generated from the following file:

doc/d-practical-exercises/src/graph.py

Public Member Functions

Public Attributes