numberlab 0.1.9

A collection of numerical 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
62
63
64
65
66
67
68
69

use numberlab::structure::graph::Graph;

#[test]
fn should_return_weight_from_node_to_node() {
    let graph = &mut Graph::from_adjacency_matrix([
        [None, Some(1.0), None, None, None, None],
        [None, None, Some(1.0), None, None, Some(1.0)],
        [None, None, None, None, None, Some(1.0)],
        [None, None, Some(1.0), None, None, None],
        [None, None, None, None, None, Some(1.0)],
        [None, None, None, None, Some(1.0), None],
    ]);

    graph[(0, 0)] = Some(1.0);
    graph[(0, 1)] = Some(1.0);
    graph[(4, 1)] = Some(1.0);
    graph[(4, 4)] = Some(1.0);
    graph[(1, 2)] = None;

    assert_eq!(graph[(0, 0)], Some(1.0));
    assert_eq!(graph[(0, 1)], Some(1.0));
    assert_eq!(graph[(4, 1)], Some(1.0));
    assert_eq!(graph[(4, 4)], Some(1.0));
    assert_eq!(graph[(1, 2)], None);
}

#[test]
fn should_return_node_label() {
    let graph = &mut Graph::from_adjacency_matrix_with_labels(
        ["A", "B", "C"],
        [
            [None, Some(1.0), Some(1.0)],
            [Some(1.0), None, Some(1.0)],
            [Some(1.0), Some(1.0), None],
        ],
    );

    graph[0] = "D".to_string();

    assert_eq!(graph[0], "D");
    assert_eq!(graph[1], "B");
    assert_eq!(graph[2], "C");
}

#[test]
fn should_display_graph() {
    let graph = &Graph::from_adjacency_matrix_with_labels(
        ["A", "B", "C", "D", "E", "F"],
        [
            [None, Some(1.0), None, None, None, Some(2.0)],
            [None, None, Some(3.0), None, None, None],
            [None, None, None, None, None, Some(4.0)],
            [None, None, Some(5.0), None, None, None],
            [None, None, None, Some(6.0), None, None],
            [None, None, None, None, Some(7.0), None],
        ],
    );
    let dis = "       A   B   C   D   E   F\
    \n----------------------------\
    \n  A |  .   1   .   .   .   2 \
    \n  B |  .   .   3   .   .   . \
    \n  C |  .   .   .   .   .   4 \
    \n  D |  .   .   5   .   .   . \
    \n  E |  .   .   .   6   .   . \
    \n  F |  .   .   .   .   7   . \
    \n";

    assert_eq!(format!("{}", graph), dis);
}