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

Method edges

Graph/DirectedGraph.h:496–501  ·  view source on GitHub ↗

Iterate through the edges of this graph. */

Source from the content-addressed store, hash-verified

494
495 /** Iterate through the edges of this graph. */
496 std::pair<edge_iterator, edge_iterator> edges() const
497 {
498 std::pair<vertex_iterator, vertex_iterator> vit = vertices();
499 return make_pair(edge_iterator(this, vit.first),
500 edge_iterator(this, vit.second));
501 }
502
503 /** Return the edge (u,v) if it exists and a flag indicating
504 * whether the edge exists.

Callers 3

edgesFunction · 0.80
edgesFunction · 0.80
edgesFunction · 0.80

Calls 2

verticesFunction · 0.70
edge_iteratorClass · 0.70

Tested by

no test coverage detected