Struct BellmanFordAlgorithm

pub struct BellmanFordAlgorithm {
    pub total_vertices: usize,
    pub edges: Vec<Edge>,
}

Bellman-Ford Algorithm. Compute shortest paths from a single source vertex to all of the other vertices in a weighted digraph.

Fields

total_vertices: usize

Total number of vertices in the graph.

edges: Vec<Edge>

Edges in the graph.

Implementations

impl BellmanFordAlgorithm

pub fn new() -> Self

Create a new instance of Bellman-Ford Algorithm.

Returns

New instance of Bellman-Ford Algorithm.

pub fn set_edge(&mut self, source: usize, edges: Vec<(usize, i32)>)

Set a node’s edges to the graph.

Arguments

• source: Source node.
• edges: Edges of the source node.

pub fn set_edges(&mut self, nodes: Vec<(usize, Vec<(usize, i32)>)>)

Set multiple nodes’ edges to the graph.

Arguments

• nodes: Vector of tuples where each tuple contains a node and its associated edges.

Trait Implementations

impl Clone for BellmanFordAlgorithm

fn clone(&self) -> BellmanFordAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BellmanFordAlgorithm

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

Formats the value using the given formatter.

impl Default for BellmanFordAlgorithm

fn default() -> Self

Create a new default instance of Bellman-Ford Algorithm.

Returns

New default instance of Bellman-Ford Algorithm.

impl GraphAlgorithm for BellmanFordAlgorithm

type Node = isize

Type of node.

type Weight = Vec<i32>

Type of weight.

fn run(&self, start: Option<Self::Node>) -> Result<Self::Weight, GraphError>

Run Bellman-Ford Algorithm.

Arguments

• start: Starting node.

Returns

Result containing a vector of shortest paths, or an error if applicable.