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

Method remove_edge_if

Graph/DirectedGraph.h:533–539  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

531 /** Remove edges that satisfy the predicate. */
532 template <typename Predicate>
533 void remove_edge_if(Predicate predicate)
534 {
535 unsigned i = 0;
536 for (typename Vertices::iterator it = m_vertices.begin();
537 it != m_vertices.end(); ++it)
538 it->remove_edge_if(vertex(i++), predicate);
539 }
540
541 /** Return true if this vertex has been removed. */
542 bool is_removed(vertex_descriptor u) const

Callers 1

remove_edge_ifFunction · 0.45

Calls 3

vertexFunction · 0.70
beginMethod · 0.45
endMethod · 0.45

Tested by

no test coverage detected