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

Function ambiguous

Graph/ExtendPath.h:369–374  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

367 */
368template <class Graph>
369static inline bool
370ambiguous(const typename boost::graph_traits<Graph>::vertex_descriptor& u,
371 Direction dir, const Graph& g, unsigned trim, unsigned fpTrim)
372{
373 return successor(u, dir, g, trim, fpTrim).second == ER_AMBI_OUT;
374}
375
376/**
377 * Return true if the given vertex has more than one possible

Callers 10

operator^Method · 0.85
indexMethod · 0.85
idMethod · 0.85
contigIndexMethod · 0.85
senseMethod · 0.85
lengthMethod · 0.85
ambiguousSequenceMethod · 0.85
ContigNodeClass · 0.85
preprocessCircularContigFunction · 0.85
trimBranchKmersFunction · 0.85

Calls 1

successorFunction · 0.85

Tested by

no test coverage detected