Struct algorithms_edu::algo::graph::WeightedAdjacencyList

pub struct WeightedAdjacencyList { /* fields omitted */ }

Implementations

impl WeightedAdjacencyList

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

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 WeightedAdjacencyList

pub fn kruskal(&self) -> Option<(f32, WeightedAdjacencyList)>

impl WeightedAdjacencyList

pub fn prim(&self) -> Option<(f32, WeightedAdjacencyList)>

impl WeightedAdjacencyList

pub fn two_color(&self) -> Result<Vec<i8>, BipartiteCheckError>

impl WeightedAdjacencyList

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

impl WeightedAdjacencyList

pub fn dijkstra(&self, start: usize, end: usize) -> Option<(f32, Vec<usize>)>

impl WeightedAdjacencyList

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

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

Imagine building a program with dependencies

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

impl WeightedAdjacencyList

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, cost: f32)

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: f32)

Add an undirected edge between nodes u and v.

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

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

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

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

pub fn edges(&self) -> impl Iterator<Item = (usize, usize, f32)> + '_

pub fn edges_count(&self) -> usize

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

pub fn vertices_count(&self) -> usize

Trait Implementations

impl Debug for WeightedAdjacencyList

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

Formats the value using the given formatter.

impl Display for WeightedAdjacencyList

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

Formats the value using the given formatter.

impl From<WeightedAdjacencyList> for WeightedAdjacencyMatrix

pub fn from(inp: WeightedAdjacencyList) -> Self

Performs the conversion.

impl Index<usize> for WeightedAdjacencyList

type Output = Vec<Edge>

The returned type after indexing.

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

Performs the indexing (container[index]) operation.