Searched refs:vertices (Results 1 – 7 of 7) sorted by relevance
218 for (const auto &V : G.vertices()) { in getGraphDiffRenderer()366 for (const auto &V : G.vertices()) { in exportGraphAsDOT()389 for (const auto &V : G.vertices()) { in exportGraphAsDOT()
314 for (auto &V : G.vertices()) { in calculateVertexStatistics()342 for (auto &V : G.vertices()) { in normalizeStatistics()422 for (const auto &V : G.vertices()) { in exportGraphAsDOT()
349 VertexView<false> vertices() { return VertexView<false>(*this); } in vertices() function351 VertexView<true> vertices() const { return VertexView<true>(*this); } in vertices() function
60 // extra utility vertices to prioritize nearby function similarity.
14 >24 long x %u vertices/frame,
3184 …unds are presented relating the speed of the algorithm to the number of vertices and the number of…3341 … minimisation of switching nets; of Boolean functions; prime implicants; simplification; vertices",4312 …vertices, Hamiltonian circuits equivalent to $.5(n - 1)!$ specific permutations of $n$ elements, t…13727 …vertices in a directed graph. These algorithms generalize the Floyd algorithm and the Dantzig algo…25371 …abstract = "Efficient new heuristic methods to color the vertices of a graph are described whi…25373 …chooses the vertex adjacent to the largest number of distinctly colored vertices. Paper also discu…25378 …ring; heuristic; mathematical techniques --- Graph Theory; maximal; operations research; vertices",25621 …ruction of objects and three-dimensional graphics; rules; scene analysis; see Section 6; vertices",25799 …essors to find the connected components of an undirected graph with $n$ vertices in time $O(log2n)…
228316 vertices