Trait TopologicalSort 

pub trait TopologicalSort {
    type Graph: VisitableGraph;

    // Required method
    fn topological_sort_opt(
        &self,
        roots: &Nodes,
        roots_only: bool,
    ) -> Result<Vec<NodeID>>;

    // Provided methods
    fn topological_sort(&self) -> Result<Vec<NodeID>> { ... }
    fn is_dag(&self) -> bool { ... }
}

A trait for a graph that supports topological sort.

Required Associated Types

type Graph: VisitableGraph

Required Methods

fn topological_sort_opt( &self, roots: &Nodes, roots_only: bool, ) -> Result<Vec<NodeID>>

Returns reverse-order of topological sort.

Provided Methods

fn topological_sort(&self) -> Result<Vec<NodeID>>

Returns reverse-order of topological sort.

fn is_dag(&self) -> bool

Implementors

impl<G> TopologicalSort for G

where G: VisitableGraph,

type Graph = G