Method new

src/graph/undirected/cc.rs:29–45

(g: &dyn IGraph)

impl CC {
    pub fn new(g: &dyn IGraph) -> Self {
        let mut cc = Self {
            count: 0,
            marked: vec![false; g.V()],
            id: vec![0; g.V()],
            size: vec![0; g.V()],
        };

        for v in 0..g.V() {
            if !cc.marked[v] {
                cc.dfs(g, v);
                cc.count += 1;
            }
        }

        cc
    }

    /// are v and w connected?
    pub fn connected(&self, v: usize, w: usize) -> bool {