[][src]Trait bigraph::StaticBigraph

pub trait StaticBigraph: StaticGraph {
    fn partner_node(&self, node_id: Self::NodeIndex) -> Option<Self::NodeIndex>;

    fn verify_node_pairing(&self) -> bool { ... }
fn verify_mirror_property(&self) -> bool { ... }
fn verify_unitig_length_is_zero(&self) -> bool { ... } }

A node-centric bidirected graph. That is a graph in which each node has a unique partner, and this relation is symmetric.

Required methods

fn partner_node(&self, node_id: Self::NodeIndex) -> Option<Self::NodeIndex>

Returns the unique partner of the given node id, or None if the given node id does not exist.

Loading content...

Provided methods

fn verify_node_pairing(&self) -> bool

Returns true if each node has exactly one partner, and this relation is symmetric.

fn verify_mirror_property(&self) -> bool

Returns true if the mirror property of edges is fulfilled. Assumes that the node pairing is correct (See verify_node_pairing())

fn verify_unitig_length_is_zero(&self) -> bool

Returns true if all unitigs in the graph have length of at most one node.

Loading content...

Implementors

impl<Topology: StaticGraph> StaticBigraph for NodeBigraphWrapper<Topology>[src]

Loading content...