Method new

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

(g: &dyn IGraph)

impl Bipartite {
    pub fn new(g: &dyn IGraph) -> Self {
        let mut tc = Self {
            marked: vec![false; g.V()],
            color: vec![false; g.V()],
            edge_to: vec![0; g.V()],
            cycle: None,
            is_bipartite: true,
        };

        for s in 0..g.V() {
            if !tc.marked[s] {
                tc.dfs(g, s);
            }
        }

        tc
    }

    pub fn is_bipartite(&self) -> bool {
        self.is_bipartite