Struct AdjGraph 

pub struct AdjGraph { /* private fields */ }

An adjacency-list directed graph.

Implementations

impl AdjGraph

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

Add a directed edge from u to v.

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

Add an undirected edge.

pub fn vertex_count(&self) -> usize

Number of vertices.

pub fn edge_count(&self) -> usize

Number of (directed) edges.

pub fn bfs(&self, start: usize) -> Vec<usize>

BFS from start; returns visited vertices in BFS order.

pub fn dfs(&self, start: usize) -> Vec<usize>

DFS from start; returns visited vertices in DFS order.

pub fn shortest_path(&self, src: usize, dst: usize) -> Option<Vec<usize>>

BFS shortest path from src to dst (unweighted). Returns None if unreachable.

pub fn is_reachable(&self, src: usize, dst: usize) -> bool

Check if dst is reachable from src via BFS.

pub fn bfs_levels(&self, start: usize) -> Vec<Option<usize>>

Return the BFS level (distance) of each vertex from start.