algorithmica 0.1.10

Rust 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

pub struct ConnectedComponent<'a> {
    visited: Vec<bool>,
    graph: &'a crate::graph::Graph,
    count: usize,
    component: Vec<usize>,
}

impl<'a> ConnectedComponent<'a> {
    pub fn new(graph: &'a crate::graph::Graph) -> Self {
        let mut cc = Self {
            visited: vec![false; graph.v],
            count: 0,
            component: vec![0; graph.v],
            graph,
        };

        for x in 0..graph.v {
            if !cc.visited[x] {
                cc.dfs(x);
                cc.count += 1;
            }
        }
        cc
    }

    pub fn count(&self) -> usize {
        self.count
    }

    pub fn id(&self, v: usize) -> usize {
        self.component[v]
    }

    fn dfs(&mut self, v: usize) {
        self.visited[v] = true;
        for x in self.graph.adj(v) {
            if !self.visited[*x] {
                self.dfs(*x);
                self.component[*x] = self.count;
            }
        }
    }
}