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

Function remove_transitive_edges

Graph/GraphAlgorithms.h:121–129  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

119 */
120template <typename Graph>
121unsigned remove_transitive_edges(Graph& g)
122{
123 typedef typename graph_traits<Graph>::edge_descriptor
124 edge_descriptor;
125 std::vector<edge_descriptor> transitive;
126 find_transitive_edges(g, back_inserter(transitive));
127 remove_edges(g, transitive.begin(), transitive.end());
128 return transitive.size();
129}
130
131/**
132 * Find transitive edges when more than one intermediate vertex exists

Callers 4

scaffoldFunction · 0.85
mainFunction · 0.85
mainFunction · 0.85
removeTransitiveEdgesFunction · 0.85

Calls 5

find_transitive_edgesFunction · 0.85
remove_edgesFunction · 0.85
beginMethod · 0.45
endMethod · 0.45
sizeMethod · 0.45

Tested by

no test coverage detected