Struct Dijkstra

pub struct Dijkstra { /* private fields */ }

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

Implementations

impl Dijkstra

pub fn new() -> Self

Create a new instance of Dijkstra’s Algorithm.

Returns

A 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 Debug for Dijkstra

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

Formats the value using the given formatter.

impl Default for Dijkstra

fn default() -> Self

Create a new default instance of Dijkstra’s Algorithm.

Returns

A new default instance of Dijkstra’s Algorithm.

impl GraphAlgorithm for Dijkstra

fn run(&self, start: usize) -> Vec<usize>

Run Dijkstra’s Algorithm.

Arguments

• start: The starting node.

Returns

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