Method new

src/graph/undirected/dfs.rs:23–30

(g: &dyn IGraph, s: usize)

impl DepthFirstSearch {
    pub fn new(g: &dyn IGraph, s: usize) -> Self {
        let mut dfs = Self {
            marked: vec![false; g.V()],
            count: 0,
        };
        dfs.dfs(g, s);
        dfs
    }

    /// is v connected to s?
    pub fn marked(&self, v: usize) -> bool {