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

Function contiguous_in

Graph/ContigGraphAlgorithms.h:48–52  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

46/** Return whether the incoming edge of vertex u is contiguous. */
47template<typename Graph>
48bool
49contiguous_in(const Graph& g, typename graph_traits<Graph>::vertex_descriptor u)
50{
51 return contiguous_out(g, get(vertex_complement, g, u));
52}
53
54/** Add the outgoing edges of vertex u to vertex uout. */
55template<typename Graph>

Callers 3

assemble_ifFunction · 0.85
depthFirstSearchFunction · 0.85
contiguousInMethod · 0.85

Calls 2

contiguous_outFunction · 0.85
getFunction · 0.70

Tested by

no test coverage detected