Trait labelgraph::DirectedGraph

pub trait DirectedGraph {
    fn link_nodes(
        &mut self,
        from_node_label: &str,
        to_node_label: &str,
        weight: i64
    );
    fn get_inputs_for_node(&self, node_label: &str) -> Option<Vec<GraphEdge>>;
    fn get_outputs_for_node(&self, node_label: &str) -> Option<Vec<GraphEdge>>;
}

Required Methods

fn link_nodes(&mut self, from_node_label: &str, to_node_label: &str, weight: i64)

Create a link from one node to another (directional). If the link already exists the weight will be updated.

fn get_inputs_for_node(&self, node_label: &str) -> Option<Vec<GraphEdge>>

Return all nodes that input into this node

fn get_outputs_for_node(&self, node_label: &str) -> Option<Vec<GraphEdge>>

Return all nodes that this node outputs to

Implementors

impl<D> DirectedGraph for DirectedLabelGraph<D>