luka 0.4.0

Library for working with graphs
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

use luka::Graph;
use luka::algorithms::topoligical_sort;

#[test]
fn integration_test_topology_sort() {
    let mut graph = Graph::new(5);

    graph.add_edge(1, 2, 0.0).unwrap();
    graph.add_edge(1, 3, 0.0).unwrap();
    graph.add_edge(1, 5, 0.0).unwrap();
    graph.add_edge(1, 4, 0.0).unwrap();
    graph.add_edge(2, 4, 0.0).unwrap();
    graph.add_edge(3, 4, 0.0).unwrap();
    graph.add_edge(3, 5, 0.0).unwrap();
    let vertexes = topoligical_sort(&graph).unwrap();
    assert_eq!(vertexes.iter().map(|vertex|vertex.id()).collect::<Vec<usize>>(), vec![1, 3, 5, 2, 4]);

    let mut graph = Graph::new(8);
    graph.add_edge(1, 2, 0.0).unwrap();
    graph.add_edge(1, 3, 0.0).unwrap();
    graph.add_edge(1, 5, 0.0).unwrap();
    graph.add_edge(1, 4, 0.0).unwrap();
    graph.add_edge(2, 4, 0.0).unwrap();
    graph.add_edge(3, 4, 0.0).unwrap();
    graph.add_edge(3, 5, 0.0).unwrap();
    graph.add_edge(6, 7, 0.0).unwrap();
    graph.add_edge(7, 8, 0.0).unwrap();
    let vertexes = topoligical_sort(&graph).unwrap();
    assert_eq!(vertexes.iter().map(|vertex|vertex.id()).collect::<Vec<usize>>(), vec![6, 7, 8, 1, 3, 5, 2, 4]);

    let mut graph = Graph::new(10);
    graph.add_edge(2, 4, 0).unwrap();
    graph.add_edge(2, 5, 0).unwrap();
    graph.add_edge(2, 1, 0).unwrap();
    graph.add_edge(3, 1, 0).unwrap();
    graph.add_edge(4, 5, 0).unwrap();
    graph.add_edge(4, 3, 0).unwrap();
    graph.add_edge(5, 3, 0).unwrap();
    let vertexes = topoligical_sort(&graph).unwrap();
    assert_eq!(vertexes.iter().map(|vertex|vertex.id()).collect::<Vec<usize>>(), vec![10, 9, 8, 7, 6, 2, 4, 5, 3, 1]);
}

#[test]
#[should_panic]
fn integration_test_exists_cycle_topology_sort() {
    let mut graph = Graph::new(5);

    graph.add_edge(1, 2, 0.0).unwrap();
    graph.add_edge(2, 3, 0.0).unwrap();
    graph.add_edge(3, 4, 0.0).unwrap();
    graph.add_edge(4, 2, 0.0).unwrap();
    let vertexes = topoligical_sort(&graph).unwrap();
    assert_eq!(vertexes.iter().map(|vertex|vertex.id()).collect::<Vec<usize>>(), vec![1, 3, 5, 2, 4]);
}