Trait handlegraph::handlegraph::HandleGraph

pub trait HandleGraph {
    fn min_node_id(&self) -> NodeId;
    fn max_node_id(&self) -> NodeId;
    fn node_count(&self) -> usize;
    fn edge_count(&self) -> usize;
    fn total_length(&self) -> usize;
}

The base HandleGraph trait, with only a tiny subset of the handlegraph behavior.

If you want to write code that's generic over handlegraphs, use the bound HandleGraphRef instead.

Required methods

fn min_node_id(&self) -> NodeId

Return the minimum NodeId that exists in the graph.

fn max_node_id(&self) -> NodeId

Return the maximum NodeId that exists in the graph.

fn node_count(&self) -> usize

Return the number of nodes in the graph.

fn edge_count(&self) -> usize

Return the number of edges in the graph.

fn total_length(&self) -> usize

Returns the sum of the sequence lengths of all nodes in the graph.

Loading content...

Implementors

impl HandleGraph for HashGraph

fn min_node_id(&self) -> NodeId

fn max_node_id(&self) -> NodeId

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn total_length(&self) -> usize

impl HandleGraph for PackedGraph

fn min_node_id(&self) -> NodeId

fn max_node_id(&self) -> NodeId

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn total_length(&self) -> usize

Loading content...