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

Function merge

Graph/ContigGraphAlgorithms.h:181–190  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

179 */
180template<typename Graph, typename It>
181typename graph_traits<Graph>::vertex_descriptor
182merge(Graph& g, It first, It last)
183{
184 typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor;
185 assert(first != last);
186 vertex_descriptor u = add_vertex(addProp(g, first, last), g);
187 copy_in_edges(g, *first, u);
188 copy_out_edges(g, *(last - 1), u);
189 return u;
190}
191
192/** Assemble unambiguous paths. Write the paths to out.
193 * Every edge must satisfy the predicate. */

Callers 1

assemble_ifFunction · 0.70

Calls 4

addPropFunction · 0.85
copy_in_edgesFunction · 0.85
copy_out_edgesFunction · 0.85
add_vertexFunction · 0.70

Tested by

no test coverage detected