79   def addSubgraph(self, graph):  argument
81     map(self.addVertex, graph.vertices)
82     map(lambda v: self.addEdges(v, *graph.getEdges(v)), graph.vertices)
85   def removeSubgraph(self, graph):  argument
87     map(self.removeVertex, graph.vertices)
101   def appendGraph(self, graph):  argument
104     self.addSubgraph(graph)
105     map(lambda v: self.addEdges(v, outputs = DirectedGraph.getRoots(graph)), leaves)
108   def prependGraph(self, graph):  argument
111     self.addSubgraph(graph)
112     map(lambda v: self.addEdges(v, outputs = roots), DirectedGraph.getLeaves(graph))
115   def getRoots(graph):  argument
117     return [v for v in graph.vertices if not len(graph.getEdges(v)[0])]
120   def getLeaves(graph):  argument
122     return [v for v in graph.vertices if not len(graph.getEdges(v)[1])]
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
153     for vertex in graph.vertices:
156           for v in DirectedGraph.depthFirstVisit(graph, vertex, seen, returnFinished, outEdges):
163   def breadthFirstSearch(graph, returnFinished = 0):  argument
167     queue = DirectedGraph.getRoots(graph)[0:1]
175       for v in graph.getEdges(vertex)[1]:
187   def topologicalSort(graph, start = None, outEdges = 1):  argument
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…