Struct algorithms_edu::algo::graph::AdjacencyList

pub struct AdjacencyList { /* fields omitted */ }

Implementations

impl AdjacencyList

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

Perform a breadth first search on a graph a starting node start.

pub fn reconstruct_path<T: Queue<usize>>(
    &self,
    start: usize,
    end: usize
) -> Vec<usize>

impl AdjacencyList

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

Perform a depth first search on a graph with n nodes from a starting point to count the number of nodes in a given component.

impl AdjacencyList

pub fn with_size(n: usize) -> Self

Initialize an empty adjacency list that can hold up to n nodes.

pub fn len(&self) -> usize

Number of nodes

pub fn is_empty(&self) -> bool

pub fn add_directed_edge(&mut self, u: usize, v: usize, cost: i32)

Add a directed edge from node u to node v with cost cost.

pub fn add_undirected_edge(&mut self, u: usize, v: usize, cost: i32)

Add an undirected edge between nodes u and v.

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

Add an undirected unweighted edge between nodes u and v. The edge added will have a weight of 1 since its intended to be unweighted.

Trait Implementations

impl Index<usize> for AdjacencyList

type Output = Vec<Edge>

The returned type after indexing.

pub fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.