Struct DirectedGraph 

pub struct DirectedGraph { /* private fields */ }

A directed graph with n nodes, represented as an adjacency list.

Implementations

impl DirectedGraph

pub fn new(n: usize) -> Self

Create a graph with n nodes and no edges.

pub fn add_edge(&mut self, u: usize, v: usize)

Add a directed edge u → v.

pub fn node_count(&self) -> usize

Return the number of nodes.

pub fn out_degree(&self, u: usize) -> usize

Return the out-degree of node u.

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

Iterate over the successors of u.

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

Compute a topological ordering using Kahn’s algorithm. Returns None if the graph contains a cycle.

pub fn strongly_connected_components(&self) -> Vec<Vec<usize>>

Compute strongly connected components using Kosaraju’s algorithm.

Trait Implementations

impl Clone for DirectedGraph

fn clone(&self) -> DirectedGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DirectedGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.