fera-graph 0.2.0

Graph 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
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112

// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.

#[macro_use]
extern crate fera_graph;

use fera_graph::algs::{Components, Cycles, Trees};
use fera_graph::prelude::*;

struct Case {
    g: StaticGraph,
    is_connected: bool,
    is_acyclic: bool,
    is_tree: bool,
}

fn cases() -> Vec<Case> {
    vec![
        Case {
            // 0
            g: graph!(),
            is_connected: true,
            is_acyclic: true,
            is_tree: true,
        },
        Case {
            // 1
            g: graph!(1),
            is_connected: true,
            is_acyclic: true,
            is_tree: true,
        },
        Case {
            // 2
            g: graph!(2),
            is_connected: false,
            is_acyclic: true,
            is_tree: false,
        },
        Case {
            // 3
            g: graph!(2, (0, 1)),
            is_connected: true,
            is_acyclic: true,
            is_tree: true,
        },
        Case {
            // 4
            g: graph!(3, (2, 1)),
            is_connected: false,
            is_acyclic: true,
            is_tree: false,
        },
        Case {
            // 5
            g: graph!(3, (2, 1)),
            is_connected: false,
            is_acyclic: true,
            is_tree: false,
        },
        Case {
            // 6
            g: graph!(3, (0, 1), (1, 2)),
            is_connected: true,
            is_acyclic: true,
            is_tree: true,
        },
        Case {
            // 7
            g: graph!(3, (0, 1), (0, 2), (1, 2)),
            is_connected: true,
            is_acyclic: false,
            is_tree: false,
        },
        Case {
            // 8
            g: graph!(4, (0, 1), (0, 2)),
            is_connected: false,
            is_acyclic: true,
            is_tree: false,
        },
        Case {
            // 9
            g: graph!(4, (1, 2), (2, 3), (3, 1)),
            is_connected: false,
            is_acyclic: false,
            is_tree: false,
        },
    ]
}

#[test]
fn is_connected() {
    for (i, case) in cases().into_iter().enumerate() {
        assert_eq!(case.is_connected, case.g.is_connected(), "Case {}", i);
    }
}

#[test]
fn is_acyclic() {
    for (i, case) in cases().into_iter().enumerate() {
        assert_eq!(case.is_acyclic, case.g.is_acyclic(), "Case {}", i);
    }
}

#[test]
fn is_tree() {
    for (i, case) in cases().into_iter().enumerate() {
        assert_eq!(case.is_tree, case.g.is_tree(), "Case {}", i);
    }
}