Method new

src/graph/undirected/cycle.rs:17–33

(g: &dyn IGraph)

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

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

        cycle
    }

    /// Returns true if the graph G has a cycle.
    pub fn has_cycle(&self) -> bool {