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

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

//! [Traversal] algorithms, including BFS, DFS, etc.
//!
//! [Traversal]: https://en.wikipedia.org/wiki/Graph_traversal

#[macro_use]
mod control;
mod visitor;
mod bfs;
mod dfs;
mod recursive_dfs;

pub use self::control::*;
pub use self::visitor::*;
pub use self::bfs::*;
pub use self::dfs::*;
pub use self::recursive_dfs::*;

use prelude::*;

pub trait Traverser<'a, G>
where
    G: 'a + Incidence,
{
    fn graph(&self) -> &G;

    fn is_discovered(&self, v: Vertex<G>) -> bool;

    fn traverse<V: Visitor<G>>(&mut self, v: Vertex<G>, vis: V) -> bool;

    fn traverse_all<V: Visitor<G>>(&mut self, vis: V)
    where
        G: VertexList;

    fn traverse_vertices<I, V>(&mut self, vertices: I, mut vis: V)
    where
        I: IntoIterator<Item = Vertex<G>>,
        V: Visitor<G>,
    {
        for v in vertices {
            if !self.is_discovered(v) {
                break_unless!(vis.discover_root_vertex(self.graph(), v));
                break_unless!(continue_if(self.traverse(v, &mut vis)));
                break_unless!(vis.finish_root_vertex(self.graph(), v));
            }
        }
    }
}