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

Method edge

Graph/DirectedGraph.h:506–513  ·  view source on GitHub ↗

Return the edge (u,v) if it exists and a flag indicating * whether the edge exists. */

Source from the content-addressed store, hash-verified

504 * whether the edge exists.
505 */
506 std::pair<edge_descriptor, bool> edge(
507 vertex_descriptor u, vertex_descriptor v) const
508 {
509 vertices_size_type ui = get(vertex_index, *this, u);
510 assert(ui < num_vertices());
511 return make_pair(edge_descriptor(u, v),
512 m_vertices[ui].edge(v));
513 }
514
515 /** Return properties of edge e. */
516 edge_property_type& operator[](edge_descriptor e)

Callers 1

edgeFunction · 0.45

Calls 2

getFunction · 0.70
num_verticesFunction · 0.70

Tested by

no test coverage detected