Struct AdjacencyList 

pub struct AdjacencyList {
    pub n: usize,
    pub edges: Vec<Vec<usize>>,
}

Unweighted graph stored as an adjacency list. Directed by default.

Fields

n: usize

edges: Vec<Vec<usize>>

Implementations

impl AdjacencyList

pub fn new(n: usize) -> Self

Create an empty graph with n nodes and no edges.

pub fn add_edge(&mut self, u: usize, v: usize) -> GraphalgResult<()>

Add a directed edge u -> v. Returns error if endpoints are out of range.

pub fn add_undirected_edge(&mut self, u: usize, v: usize) -> GraphalgResult<()>

Add an undirected edge (u, v).

pub fn num_edges(&self) -> usize

Total number of directed edges stored.

pub fn neighbors(&self, u: usize) -> GraphalgResult<&[usize]>

Out-neighbors of vertex u.

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

Compute the in-degree of each vertex.

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

Compute the out-degree of each vertex.

pub fn reverse(&self) -> Self

Return the reverse graph (reverse all directed edges).

Trait Implementations

impl Clone for AdjacencyList

fn clone(&self) -> AdjacencyList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyList

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

Formats the value using the given formatter.