Class Topological

src/graph/directed/sort.rs:14–16

The Topological represents a data type for determining a topological order of a directed acyclic graph (DAG). A digraph has a topological order if and only if it is a DAG. The has_order operation determines whether the digraph has a topological order, and if so, the order operation returns one. This implementation uses depth-first search.

/// returns one.
/// This implementation uses depth-first search.
pub struct Topological {
    order: Option<Vec<usize>>,
}

impl Topological {
    /// Does the digraph have a topological order?