Public Member Functions | |
| def | __init__ |
| method calls set the graph to empty and | |
| def | setAdjacencyList |
| set the adjacency list to adjList | |
| def | setInvAdjacencyList |
| set the adjacency list to adjList | |
| def | appendEdge |
| Append an edge to the graph. | |
| def | set_node_info |
| def | node_info |
| def | setInvAdj |
| called by appendEdge | |
| def | setAdj |
| called by appendEdge | |
| def | appendNode |
| def | __iter__ |
| def | iter_edges |
| def | getAdjacencyList |
| get the adjacency matrix for the graph | |
| def | getInvAdjacencyList |
| def | getEdgeColour |
| def | getEdgeType |
| def | getEdge |
| def | adj |
| return a list of all indices pointed to by element item | |
| def | invAdj |
| def | getAllNodes |
| def | getSourceNodes |
| return all nodes which do not depend on any other node | |
| def | transp |
| def | __len__ |
| def | clean |
| def | numedges |
| def | __repr__ |
Static Public Attributes | |
| tuple | env = InstanceManager() |
Definition at line 37 of file DiGraph.py.
| def __init__ | ( | self | ) |
| def setAdjacencyList | ( | self, | ||
| adjList | ||||
| ) |
| def setInvAdjacencyList | ( | self, | ||
| adjList | ||||
| ) |
| def appendEdge | ( | self, | ||
| source, | ||||
| target, | ||||
Etype = False, |
||||
colour = 'black' | ||||
| ) |
Append an edge to the graph.
| source,: | doesn't have to be in the graph already | |
| target,: | doesn't have to be in the graph already | |
| colour,: | 'red' if data -> container 'green' if container -> data 'black' [default] if other |
Definition at line 97 of file DiGraph.py.
| def set_node_info | ( | self, | ||
| node, | ||||
| kw | ||||
| ) |
Definition at line 106 of file DiGraph.py.
| def node_info | ( | self, | ||
| node | ||||
| ) |
Definition at line 110 of file DiGraph.py.
| def setInvAdj | ( | self, | ||
| source, | ||||
| target, | ||||
| Etype, | ||||
| colour | ||||
| ) |
| def setAdj | ( | self, | ||
| source, | ||||
| target, | ||||
| Etype, | ||||
| colour | ||||
| ) |
| def appendNode | ( | self, | ||
| node | ||||
| ) |
Definition at line 142 of file DiGraph.py.
| def __iter__ | ( | self | ) |
Definition at line 147 of file DiGraph.py.
| def iter_edges | ( | self | ) |
Definition at line 151 of file DiGraph.py.
| def getAdjacencyList | ( | self | ) |
| def getInvAdjacencyList | ( | self | ) |
Definition at line 181 of file DiGraph.py.
| def getEdgeColour | ( | self, | ||
| u, | ||||
| v | ||||
| ) |
Definition at line 185 of file DiGraph.py.
| def getEdgeType | ( | self, | ||
| u, | ||||
| v | ||||
| ) |
Definition at line 192 of file DiGraph.py.
| def getEdge | ( | self, | ||
| u, | ||||
| v | ||||
| ) |
Definition at line 199 of file DiGraph.py.
| def adj | ( | self, | ||
| item | ||||
| ) |
| def invAdj | ( | self, | ||
| item | ||||
| ) |
Definition at line 219 of file DiGraph.py.
| def getAllNodes | ( | self, | ||
s = None | ||||
| ) |
Definition at line 228 of file DiGraph.py.
| def getSourceNodes | ( | self | ) |
| def transp | ( | self | ) |
Definition at line 244 of file DiGraph.py.
| def __len__ | ( | self | ) |
Definition at line 255 of file DiGraph.py.
| def clean | ( | self | ) |
Definition at line 258 of file DiGraph.py.
| def numedges | ( | self | ) |
Definition at line 261 of file DiGraph.py.
| def __repr__ | ( | self | ) |
Definition at line 269 of file DiGraph.py.
tuple env = InstanceManager() [static] |
Definition at line 38 of file DiGraph.py.
1.5.6