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

// 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/.

#[cfg(feature = "quickcheck")]
#[macro_use]
extern crate quickcheck;
extern crate fera_graph;

#[cfg(feature = "quickcheck")]
mod quickchecks {
    use fera_graph::algs::components::{cut_edges_naive, cut_vertices_naive};
    use fera_graph::algs::Components;
    use fera_graph::prelude::*;

    use fera_graph::arbitrary::Gn;

    fn sorted<T: Ord>(mut v: Vec<T>) -> Vec<T> {
        v.sort();
        v
    }

    quickcheck! {
        fn cut_vertices(g: Gn<StaticGraph>) -> bool {
            let g = g.0;
            if g.num_vertices() > 20 {
                return true
            }
            let expect = sorted(cut_vertices_naive(&g));
            let actual = sorted(g.cut_vertices());
            expect == actual
        }

        fn cut_edges(g: Gn<StaticGraph>) -> bool {
            let g = g.0;
            if g.num_vertices() > 20 {
                return true
            }
            let expect = sorted(cut_edges_naive(&g));
            let actual = sorted(g.cut_edges());
            expect == actual
        }
    }
}