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

Method num_edges

Graph/DirectedGraph.h:472–479  ·  view source on GitHub ↗

Return the number of edges. */

Source from the content-addressed store, hash-verified

470
471 /** Return the number of edges. */
472 edges_size_type num_edges() const
473 {
474 edges_size_type n = 0;
475 std::pair<vertex_iterator, vertex_iterator> vit = vertices();
476 for (vertex_iterator v = vit.first; v != vit.second; ++v)
477 n += out_degree(*v);
478 return n;
479 }
480
481 /** Return the out degree of vertex u. */
482 degree_size_type out_degree(vertex_descriptor u) const

Callers 3

num_edgesFunction · 0.80
num_edgesFunction · 0.80
num_edgesFunction · 0.80

Calls 2

verticesFunction · 0.70
out_degreeFunction · 0.70

Tested by

no test coverage detected