Lines Matching defs:vertices
44 // Compare two vertices of a graph by their degrees.
62 // Order the vertices of a graph using its (approximately) largest
64 // vertices that have no edges connecting them. The maximum
67 // breadth first search that explores the vertices in order of
73 // search where the vertices are explored in increasing order of their
81 const HashSet<Vertex>& vertices = graph.vertices();
82 const int num_vertices = vertices.size();
93 // Mark all vertices white.
96 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
97 it != vertices.end();
127 // Iterate over the vertices and add all the grey vertices to the
129 // vertices in the graph.
148 // update the connected components of all the vertices. This updating
176 // cycle in G_T} and the degree of all the vertices in G_T remains
192 // weight. Also add the vertices of the graph to the Maximum
195 const HashSet<Vertex>& vertices = graph.vertices();
196 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
197 it != vertices.end();
228 // Check if either of the vertices are of degree 2 already, in
237 // vertices belong to. If the id is the same, it means that the
