Struct DijkstraAlgorithm

pub struct DijkstraAlgorithm {
    pub graph: HashMap<usize, Vec<(usize, usize)>>,
}

Dijkstra’s Algorithm. Find the shortest path from a starting node to all other nodes in a weighted graph.

Fields

graph: HashMap<usize, Vec<(usize, usize)>>

Graph to search.

Implementations

impl DijkstraAlgorithm

pub fn new() -> Self

Create a new instance of Dijkstra’s Algorithm.

Returns

New instance of Dijkstra’s Algorithm.

pub fn set_node(&mut self, node: usize, edges: Vec<(usize, usize)>)

Set the node of the graph.

Arguments

• node: Node of the graph.
• edges: Edges of the node.

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

Set the nodes of the graph.

Arguments

• nodes: Vector of nodes and their edges.

Trait Implementations

impl Clone for DijkstraAlgorithm

fn clone(&self) -> DijkstraAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DijkstraAlgorithm

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

Formats the value using the given formatter.

impl Default for DijkstraAlgorithm

fn default() -> Self

Create a new default instance of Dijkstra’s Algorithm.

Returns

New default instance of Dijkstra’s Algorithm.

impl GraphAlgorithm for DijkstraAlgorithm

type Node = usize

Type of node.

type Weight = Vec<usize>

Type of weight.

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

Run Dijkstra’s Algorithm.

Arguments

• start: Starting node.

Returns

Vector of the shortest path from the starting node to all other nodes.