Method dfs

src/graph/util/paths.rs:96–104

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

    }

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

impl BreadthFirstPaths {