Method dfs

src/graph/undirected/dfs.rs:47–55

(&mut self, g: &dyn IGraph, v: usize)

impl DepthFirstSearch {
    fn dfs(&mut self, g: &dyn IGraph, v: usize) {
        self.marked[v] = true;
        self.count += 1;
        for &w in g.adj(v) {
            if !self.marked[w] {
                self.dfs(g, w);
            }
        }
    }
}