Struct DirectedLabelGraph 

pub struct DirectedLabelGraph<D> { /* private fields */ }

Holds the nodes of the graph

Implementations

impl<D> DirectedLabelGraph<D>

pub fn new() -> Self

Examples found in repository

examples/make_graph.rs (line 7)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

pub fn check_node_exists(&self, node_label: &str) -> bool

pub fn create_node(&mut self, node_label: &str, node_data: D)

Examples found in repository

examples/make_graph.rs (line 13)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

pub fn get_node_data(&self, node_label: &str) -> Option<&D>

Examples found in repository

examples/make_graph.rs (line 22)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

pub fn get_mut_node_data(&mut self, node_label: &str) -> Option<&mut D>

Examples found in repository

examples/make_graph.rs (line 26)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

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

Examples found in repository

examples/make_graph.rs (line 18)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

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

Examples found in repository

examples/make_graph.rs (line 38)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

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

Examples found in repository

examples/make_graph.rs (line 37)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

pub fn iter_node_data(&self) -> impl Iterator<Item = &D>

pub fn iter_node_label_and_data(&self) -> impl Iterator<Item = (&String, &D)>

Examples found in repository

examples/make_graph.rs (line 32)

fn main() {
    let mut g = DirectedLabelGraph::new();

    let n1 = NodeData(2);
    let n2 = NodeData(3);
    let n3 = NodeData(4);

    g.create_node("n1", n1);
    g.create_node("n2", n2);
    g.create_node("n3", n3);

    println!("linking: n1 -> n2\n");
    g.link_nodes("n1", "n2", 1);

    println!(
        "n1's data before being modified: {:?}",
        g.get_node_data("n1")
    );
    {
        // modify n1's data
        let n1_data = g.get_mut_node_data("n1").unwrap();
        n1_data.0 = 100;
    }
    println!("n1's data after modified: {:?}\n", g.get_node_data("n1"));

    println!("Iter through node label and data:");
    for nd in g.iter_node_label_and_data() {
        println!("node data -> {:?}", nd)
    }
    println!();

    println!("n1 outputs to: {:?}", g.get_outputs_for_node("n1"));
    println!("n2 take input from: {:?}", g.get_inputs_for_node("n2"));
}

Trait Implementations

impl<D: Debug> Debug for DirectedLabelGraph<D>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<D> Default for DirectedLabelGraph<D>

fn default() -> Self

Returns the “default value” for a type.