recollection 0.1.0

implementations and reimplementations of common data structures and algorithms
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

use recollection::prelude::*;

#[test]
fn graph_insert_remove() -> RecolResult<()> {
    let mut graph = Graph::<&'static str, &'static str>::new_directed();

    let chris = graph.add("Chris");
    let jazzy = graph.add("Jazzy");
    let baby = graph.add("Baby");
    let cat = graph.add("Cat");
    let man = graph.add("Man");
    debug_assert_eq!(5, graph.node_count());

    let jazzy_baby = graph.add_edge(jazzy, baby, "loves");
    let baby_jazzy = graph.add_edge(baby, jazzy, "takes care of");
    let chris_baby = graph.add_edge(chris, baby, "loves");
    let jazzy_chris = graph.add_edge(jazzy, chris, "annoys");
    let cat_jazzy = graph.add_edge(cat, jazzy, "loves");
    let cat_baby = graph.add_edge(cat, baby, "annoys");
    let chris_cat = graph.add_edge(chris, cat, "eats");
    let man_cat = graph.add_edge(man, cat, "pets");
    let cat_man = graph.add_edge(cat, man, "meows");
    let man_jazzy = graph.add_edge(man, jazzy, "annoys");
    debug_assert_eq!(10, graph.edge_count());



    println!("R1: EDGES {:#?} NODES {:#?} exp: (10, 5)", 
        graph.edge_count(), graph.node_count());
        graph.edges_log();
        graph.nodes_log();
    graph.remove_edge(cat_man);
    debug_assert_eq!(9, graph.edge_count());

    println!("R2: EDGES {:#?} NODES {:#?} exp: (9, 5)", 
        graph.edge_count(), graph.node_count());
        graph.edges_log();
        graph.nodes_log();
    graph.remove(man);
    debug_assert_eq!(7, graph.edge_count());
    debug_assert_eq!(4, graph.node_count());

    println!("R3: EDGES {:#?} NODES {:#?} exp: (7, 4)", 
        graph.edge_count(), graph.node_count());
        graph.edges_log();
        graph.nodes_log();
    graph.remove(chris);
    debug_assert_eq!(4, graph.edge_count());
    debug_assert_eq!(3, graph.node_count());

    println!("R4: EDGES {:#?} NODES {:#?} exp: (4, 3)", 
        graph.edge_count(), graph.node_count());
        graph.edges_log();
        graph.nodes_log();


    println!("FIND BABY{}-JAZZy{} EDGE: {:?}", baby, jazzy, graph.get_edge(baby, jazzy));

    println!("{:#?}", graph);
    Ok(())
}