Expand description

Implementation of bidirectional Dijkstra’s algorithm for shortest paths.

Structs

Bidirectional Dijkstra’s shortest path algorithm.

Functions

Solve shortest path with bidirectional Dijkstra as bidirected graph.
Solve shortest path with bidirectional Dijkstra as directed graph.
Compute a shortest path with bidirectional Dijkstra algorithm on an undirected graph.