gatb.core-API-0.0.0
|
Specific Node structure representing a branching node in the De Bruijn graph. More...
#include <Graph.hpp>
Additional Inherited Members | |
Public Types inherited from Node_t< Value_t > | |
typedef Value_t | Value |
Public Member Functions inherited from Node_t< Value_t > | |
Node_t () | |
Node_t (const Node_t::Value &kmer, kmer::Strand strand=kmer::STRAND_FORWARD, u_int16_t abundance=0, u_int64_t mphfIndex=0) | |
bool | operator== (const Node_t &other) const |
bool | operator!= (const Node_t &other) const |
bool | operator< (const Node_t &other) const |
void | set (const Node_t::Value &kmer, const kmer::Strand &strand) |
Public Attributes inherited from Node_t< Value_t > | |
Node_t::Value | kmer |
kmer::Strand | strand |
u_int16_t | abundance |
Specific Node structure representing a branching node in the De Bruijn graph.
The BranchingNode inherits from the Node structure.
Its semantics is to define nodes this way: indegree!=1 || outdegree!=1
Note: with such a definition, nodes that are tips (ie indegree==0 || outdegree=0) are considered as branching. This could be refined if needed (defined this way for historical matters).
Its main usage is to be the template specialization type for some Graph class methods.