Struct SimpleDag 

pub struct SimpleDag { /* private fields */ }

A simple directed acyclic graph.

Implementations

impl SimpleDag

pub fn new(n: usize) -> Self

Creates a DAG with n nodes and no edges.

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

Adds an edge from from to to.

pub fn successors(&self, node: usize) -> &[usize]

Returns the successors of node.

pub fn can_reach(&self, from: usize, to: usize) -> bool

Returns true if from can reach to via DFS.

pub fn topological_sort(&self) -> Option<Vec<usize>>

Returns the topological order of nodes, or None if a cycle is detected.

pub fn num_nodes(&self) -> usize

Returns the number of nodes.