Struct FloydWarshallAlgorithm

pub struct FloydWarshallAlgorithm {
    pub total_nodes: usize,
    pub edges: Vec<(usize, usize, i32)>,
}

Floyd-Warshall Algorithm. Compute shortest paths between all pairs of vertices in a weighted graph.

Fields

total_nodes: usize

Total number of nodes in the graph.

edges: Vec<(usize, usize, i32)>

Edges in the graph.

Implementations

impl FloydWarshallAlgorithm

pub fn new() -> Self

Create a new instance of Floyd-Warshall Algorithm.

Returns

New instance of Floyd-Warshall Algorithm.

pub fn set_edge(&mut self, source: usize, target: usize, weight: i32)

Set a single edge to the graph.

Arguments

• source: Source node.
• target: Target node.
• weight: Weight of the edge.

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.

pub fn set_total_nodes(&mut self, total: usize)

Set the total number of nodes in the graph.

Arguments

• total: Total number of nodes in the graph.

Trait Implementations

impl Clone for FloydWarshallAlgorithm

fn clone(&self) -> FloydWarshallAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FloydWarshallAlgorithm

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

Formats the value using the given formatter.

impl Default for FloydWarshallAlgorithm

fn default() -> Self

Create a new default instance of Floyd-Warshall Algorithm.

Returns

New default instance of Floyd-Warshall Algorithm.

impl GraphAlgorithm for FloydWarshallAlgorithm

type Node = usize

Type of node.

type Weight = Vec<Vec<i32>>

Type of weight.

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

Run Floyd-Warshall algorithm.

Arguments

• start: Starting node. This is not used in Floyd-Warshall algorithm.

Returns

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