Struct Graph 

pub struct Graph<N> {
    pub graph: FxMapGraph,
    pub inv_names: Vec<N>,
}

An adjacency list representation of a generic graph, including the map required to go from node index to the original node name. The N type parameter is the node name in the original graph, e.g. BString for GFA graphs, or usize for graphs that use integer names.

Fields

graph: FxMapGraph

inv_names: Vec<N>

Implementations

impl Graph<usize>

pub fn from_edges<I>(input: I) -> Graph<usize>

where I: Iterator<Item = (usize, usize)>,

Construct an adjacency graph from an iterator over the edges of an existing graph. Both the input and output have usize node IDs, but from_edges performs a transformation to ensure all the node IDs are consecutive starting from 0.

impl Graph<Vec<u8>>

pub fn from_gfa_reader<T: BufRead>(reader: &mut T) -> Graph<Vec<u8>>

Constructs an adjacency list representation of the given GFA file input stream, parsing the GFA line-by-line and only keeping the links. Returns the graph as an adjacency list and a map from graph indices to GFA segment names.

impl<N: Clone> Graph<N>

pub fn invert_components(&self, components: Vec<Vec<usize>>) -> Vec<Vec<N>>

Given a vector of graph components (as produced by