Method new

src/graph/directed/transitive_closure.rs:20–26

Computes the transitive closure of the digraph

(graph: &dyn IGraph)

impl TransitiveClosure {
    /// Computes the transitive closure of the digraph
    pub fn new(graph: &dyn IGraph) -> Self {
        let mut tc = Vec::with_capacity(graph.V());
        for v in 0..graph.V() {
            tc.push(DirectedDFS::new_single(graph, v));
        }
        Self { tc }
    }

    /// Is there a directed path from vertex v to vertex w in the digraph?
    pub fn reachable(&self, v: usize, w: usize) -> bool {