21   def addVertex(self, vertex):  argument
24     if vertex is None: return
25     if not vertex in self.vertices:
26       self.vertices.append(vertex)
27       self.clearEdges(vertex)
30   def addEdges(self, vertex, inputs = [], outputs = []):  argument
33     self.addVertex(vertex)
36       if not vertex is None and not input is None:
37         if not input  in self.inEdges[vertex]: self.inEdges[vertex].append(input)
38         if not vertex in self.outEdges[input]: self.outEdges[input].append(vertex)
41       if not vertex is None and not output is None:
42         if not vertex in self.inEdges[output]:  self.inEdges[output].append(vertex)
43         if not output in self.outEdges[vertex]: self.outEdges[vertex].append(output)
46   def getEdges(self, vertex):  argument
47     return (self.inEdges[vertex], self.outEdges[vertex])
49   def clearEdges(self, vertex, inOnly = 0, outOnly = 0):  argument
53       self.inEdges[vertex]  = []
55       self.outEdges[vertex] = []
58   def removeVertex(self, vertex):  argument
61     if vertex is None: return
62     if vertex in self.vertices:
63       self.vertices.remove(vertex)
64       del self.inEdges[vertex]
65       del self.outEdges[vertex]
67         if vertex in self.inEdges[v]:  self.inEdges[v].remove(vertex)
68         if vertex in self.outEdges[v]: self.outEdges[v].remove(vertex)
71   def replaceVertex(self, vertex, newVertex):  argument
74     if vertex is None or newVertex is None: return
75     self.addEdges(newVertex, self.inEdges[vertex], self.outEdges[vertex])
76     self.removeVertex(vertex)
96     for vertex in DirectedGraph.breadthFirstSearch(self):
97       self.printIndent(vertex.__level)
98 …vertex))+') '+str(vertex.__class__.__module__)+' in: '+str(map(self.vertices.index, self.inEdges[v…
125   def depthFirstVisit(graph, vertex, seen = None, returnFinished = 0, outEdges = 1):  argument
131     seen.append(vertex)
133       yield vertex
135     for v in graph.getEdges(vertex)[outEdges]:
143       yield vertex
153     for vertex in graph.vertices:
154       if not vertex in seen:
156           for v in DirectedGraph.depthFirstVisit(graph, vertex, seen, returnFinished, outEdges):
174       vertex = queue[-1]
175       for v in graph.getEdges(vertex)[1]:
178           v.__level = vertex.__level + 1
182       vertex = queue.pop()
184         yield vertex
190 …vertices = [vertex for vertex in DirectedGraph.depthFirstSearch(graph, returnFinished = 1, outEdge…
192 …vertices = [vertex for vertex in DirectedGraph.depthFirstVisit(graph, start, returnFinished = 1, o…
194     for vertex in vertices:
195       yield vertex