Lines Matching refs:vertices

7   def __init__(self, vertices = []):  argument
9     self.vertices = []
12     map(self.addVertex, vertices)
16     return len(self.vertices)
19 …return 'DirectedGraph with '+str(len(self.vertices))+' vertices and '+str(reduce(lambda k,l: k+l, …
25     if not vertex in self.vertices:
26       self.vertices.append(vertex)
62     if vertex in self.vertices:
63       self.vertices.remove(vertex)
66       for v in self.vertices:
81     map(self.addVertex, graph.vertices)
82     map(lambda v: self.addEdges(v, *graph.getEdges(v)), graph.vertices)
87     map(self.removeVertex, graph.vertices)
95     print('I am a DirectedGraph with '+str(len(self.vertices))+' vertices')
98 …vertices.index(vertex))+') '+str(vertex.__class__.__module__)+' in: '+str(map(self.vertices.index,…
117     return [v for v in graph.vertices if not len(graph.getEdges(v)[0])]
122     return [v for v in graph.vertices if not len(graph.getEdges(v)[1])]
153     for vertex in graph.vertices:
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…
193     vertices.reverse()
194     for vertex in vertices: