MCPcopy Create free account
hub / github.com/BirolLab/abyss / vertices

Method vertices

Graph/DirectedGraph.h:366–370  ·  view source on GitHub ↗

Returns an iterator-range to the vertices. */

Source from the content-addressed store, hash-verified

364
365 /** Returns an iterator-range to the vertices. */
366 std::pair<vertex_iterator, vertex_iterator> vertices() const
367 {
368 return make_pair(vertex_iterator(0),
369 vertex_iterator(num_vertices()));
370 }
371
372 /** Remove all the edges and vertices from this graph. */
373 void clear() { m_vertices.clear(); m_removed.clear(); }

Callers 8

nextVertexMethod · 0.80
verticesFunction · 0.80
verticesFunction · 0.80
assemble_ifFunction · 0.80
nextVertexMethod · 0.80
verticesFunction · 0.80
addOverlapsSAFunction · 0.80
buildPathGraphFunction · 0.80

Calls 2

vertex_iteratorClass · 0.70
num_verticesFunction · 0.70

Tested by

no test coverage detected