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

use crate::graph::Graph;
#[allow(dead_code)]
pub struct DiDFS<'a> {
    source: usize,
    visited: Vec<bool>,
    graph: &'a Graph,
}

impl<'a> DiDFS<'a> {
    pub fn new(source: usize, graph: &'a Graph) -> Self {
        let mut new = DiDFS {
            source,
            visited: vec![false; graph.v],
            graph,
        };
        new.dfs(source);
        new
    }

    pub fn has_path(&self, w: usize) -> bool {
        self.visited[w]
    }

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