Trait GenericNode 

pub trait GenericNode {
    // Required methods
    fn id(&self) -> usize;
    fn is_self_complemental(&self) -> bool;
    fn edges(&self) -> impl Iterator<Item = GenericEdge>;
}

A node representing a unitig with the edges of a bidirected de Bruijn graph, inspired by bcalm2’s fasta format.

Required Methods

fn id(&self) -> usize

A unique identifier of this node. The identifiers of the nodes need to be numbered consecutively starting from 0.

fn is_self_complemental(&self) -> bool

Return true if this node is self-complemental, i.e. if the reverse complement of the first k-1 characters equals the last k-1 characters.

fn edges(&self) -> impl Iterator<Item = GenericEdge>

Return an iterator over the edges of the node. It is enough to return the edges that also bcalm2 would return.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors