gatb.core-API-0.0.0
|
Definition of an Edge, ie a transition between two nodes in the De Bruijn graph. More...
#include <Graph.hpp>
Public Member Functions | |
bool | operator< (const Edge_t< Node_t > &other) const |
void | set (const typename Node_t::Value &kmer_from, kmer::Strand strand_from, const typename Node_t::Value &kmer_to, kmer::Strand strand_to, kmer::Nucleotide n, Direction dir) |
Public Attributes | |
Node_t | from |
Node_t | to |
kmer::Nucleotide | nt |
Direction | direction |
Definition of an Edge, ie a transition between two nodes in the De Bruijn graph.
The Edge structure represents an oriented transition between two nodes. Therefore, it holds:
The Edge objects are mainly provided by the Graph class, for instance when neighbors of a node are needed.
The Edge structure may be used as a template specialization type for some Graph class methods.
Overload of operator <. May not really mean much to compare edges, but is used in Minia's graph simplifications
|
inline |
Setter for some attributes of the Edge object.
[in] | kmer_from | : kmer value of the 'from' Node |
[in] | strand_from | : strand of the 'from' Node |
[in] | kmer_to | : kmer value of the 'to' Node |
[in] | strand_to | : strand of the 'to' Node |
[in] | n | : the transition nucleotide |
[in] | dir | : direction of the transition. |
Direction direction |
The direction of the transition.
Node_t from |
The source node of the edge.
The transition nucleotide.
Node_t to |
The target node of the edge.