labelgraph 2.2.3

A simple to use graph implementation, allowing random access to nodes via labels.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

use labelgraph::*;

#[derive(Debug)]
struct NodeData(i32);

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"));
}