11     self.outEdges = {}
38         if not vertex in self.outEdges[input]: self.outEdges[input].append(vertex)
43         if not output in self.outEdges[vertex]: self.outEdges[vertex].append(output)
47     return (self.inEdges[vertex], self.outEdges[vertex])
55       self.outEdges[vertex] = []
65       del self.outEdges[vertex]
68         if vertex in self.outEdges[v]: self.outEdges[v].remove(vertex)
75     self.addEdges(newVertex, self.inEdges[vertex], self.outEdges[vertex])
98 …rtices.index, self.inEdges[vertex]))+' out: '+str(map(self.vertices.index, self.outEdges[vertex])))
125   def depthFirstVisit(graph, vertex, seen = None, returnFinished = 0, outEdges = 1):  argument
135     for v in graph.getEdges(vertex)[outEdges]:
138           for v2 in DirectedGraph.depthFirstVisit(graph, v, seen, returnFinished, outEdges):
147   def depthFirstSearch(graph, returnFinished = 0, outEdges = 1):  argument
156           for v in DirectedGraph.depthFirstVisit(graph, vertex, seen, returnFinished, outEdges):
187   def topologicalSort(graph, start = None, outEdges = 1):  argument
190 …ertex for vertex in DirectedGraph.depthFirstSearch(graph, returnFinished = 1, outEdges = outEdges)]
192 …for vertex in DirectedGraph.depthFirstVisit(graph, start, returnFinished = 1, outEdges = outEdges)]