Struct TopSort 

pub struct TopSort { /* private fields */ }

Incremental builder for a directed graph over usize nodes. Consume with into_sorted for a topological ordering.

Implementations

impl TopSort

pub fn new() -> Self

pub fn add_node(&mut self, i: usize)

pub fn add_edge(&mut self, from: usize, to: usize)

Add a directed edge from → to. Endpoints are auto-inserted if not present.

pub fn into_sorted(self) -> Result<Vec<usize>, String>

Consume self and return a topological ordering, or an error if the graph has a cycle.

Trait Implementations

impl Default for TopSort

fn default() -> Self

Returns the “default value” for a type.

impl<I> FromIterator<(usize, I)> for TopSort

where I: IntoIterator<Item = usize>,

fn from_iter<T: IntoIterator<Item = (usize, I)>>(iter: T) -> Self

Creates a value from an iterator.