Struct algorithms_edu::algo::graph::UnweightedAdjacencyList

pub struct UnweightedAdjacencyList { /* fields omitted */ }

Implementations

impl UnweightedAdjacencyList

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

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

impl UnweightedAdjacencyList

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 UnweightedAdjacencyList

pub fn eulerian_path(&self) -> Result<Vec<usize>, EulerianPathError>

Returns a list of edges_count + 1 node ids that give the Eulerian path or an EulerianPathError if no path exists or the graph is disconnected.

impl UnweightedAdjacencyList

pub fn scc(&self) -> SccResult

impl UnweightedAdjacencyList

pub fn is_isomorphic_with(&self, other: &UnweightedAdjacencyList) -> bool

impl UnweightedAdjacencyList

pub fn with_size(n: usize) -> Self

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

pub fn is_empty(&self) -> bool

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

Add a directed edge from node u to node v

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

Add an undirected edge between nodes u and v.

pub fn new_directed(size: usize, edges: &[[usize; 2]]) -> Self

pub fn new_undirected(size: usize, edges: &[[usize; 2]]) -> Self

pub fn edges(&self) -> impl Iterator<Item = [usize; 2]> + '_

pub fn edges_count(&self) -> usize

pub fn vertices(&self) -> impl Iterator<Item = (usize, &Vec<usize>)>

pub fn vertices_count(&self) -> usize

Trait Implementations

impl BfsReconstructPath for UnweightedAdjacencyList

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 Debug for UnweightedAdjacencyList

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

Formats the value using the given formatter.

impl DfsRecursive for UnweightedAdjacencyList

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

impl Index<usize> for UnweightedAdjacencyList

type Output = Vec<usize>

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl TreeCenter for UnweightedAdjacencyList

pub fn center(&self) -> Center