Skip to main content

dijkstra_with_predecessors

graphrust_algos::dijkstra

Function dijkstra_with_predecessors 

Source 
pub fn dijkstra_with_predecessors(
    graph: &Graph,
    start: NodeId,
) -> (HashMap<NodeId, f64>, HashMap<NodeId, NodeId>)
Expand description

Computes shortest distances and predecessor map for path reconstruction.

§Arguments

  • graph - The graph with edge weights
  • start - The starting node

§Returns

Tuple of (distances HashMap, predecessors HashMap)