grafferous 0.1.1

A rusty graph library with a focus on generic data in nodes
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

// #![allow(dead_code)]

use grafferous::{count_paths, generate_cycle_graph, generate_grid_graph, Graph};

#[test]
fn test_generate_cycle_graph() {
    let g = generate_cycle_graph::<u32>(10_000);
    assert_eq!(g.nodes.len(), 10_000);
    assert_eq!(g.edges.len(), 10_000);
}

#[test]
fn test_generate_grid_graph() {
    let g = generate_grid_graph::<u32>(100, 100);
    assert_eq!(g.nodes.len(), 10_000);
    assert_eq!(g.edges.values().flatten().count(), 2 * (20_000 - 100 - 100));
}

#[test]
fn test_empty_creation() {
    let g = Graph::<usize, u32>::new();
    assert_eq!(g.nodes.len(), 0);
    assert_eq!(g.edges.len(), 0);
}

#[test]
fn test_count_paths() {
    let mut g = Graph::<usize, u32>::new();

    g.add_directed_edge(0, 1);
    g.add_directed_edge(1, 2);
    g.add_directed_edge(2, 3);
    g.add_directed_edge(3, 4);
    g.add_directed_edge(4, 5);
    g.add_directed_edge(5, 6);

    assert_eq!(count_paths(&g, &0, &6, None), 1);
    assert_eq!(count_paths(&g, &1, &6, None), 1);
    assert_eq!(count_paths(&g, &2, &6, None), 1);
    assert_eq!(count_paths(&g, &3, &6, None), 1);
    assert_eq!(count_paths(&g, &4, &6, None), 1);
    assert_eq!(count_paths(&g, &5, &6, None), 1);
    assert_eq!(count_paths(&g, &6, &6, None), 1);
}

//test count paths fails on cycles
#[test]
#[should_panic]
fn test_count_paths_cycle() {
    let mut g = Graph::<usize, u32>::new();

    g.add_edge(0, 1);
    g.add_edge(1, 2);
    g.add_edge(2, 3);
    g.add_edge(3, 4);
    g.add_edge(4, 5);
    g.add_edge(5, 6);
    g.add_edge(6, 0);

    count_paths(&g, &0, &6, None);
}

//test teh graph macro
#[test]
fn test_graph_macro() {
    let g: Graph<i32, ()> = grafferous::graph! {
        0 => 1,
        1 => 2,
        2 => 3,
        3 => 4,
        4 => 5,
        5 => 6
    };

    assert_eq!(g.nodes.len(), 7);
    assert_eq!(g.edge_tuples().len(), 6);

    let g: Graph<i32, ()> = grafferous::graph! {
        0 ; 1,
        1 ; 2,
        2 ; 3,
        3 ; 4,
        4 ; 5,
        5 ; 6
    };

    assert_eq!(g.nodes.len(), 7);
    assert_eq!(g.edge_tuples().len(), 12);
}

//random graph test
#[test]
fn test_random_graph() {
    let g = grafferous::generate_random_graph::<u32>(100, 0.1);
    assert_eq!(g.nodes.len(), 100);
}