Expand description

Module for shortest path algorithms.

This module contains functions for various algorithms that compute the shortest path of a graph.

Functions

A* shortest path algorithm.
Bellman-Ford shortest path algorithm with the SPFA heuristic.
Dijkstra’s shortest path algorithm.
k’th shortest path algorithm.
Finds an arbitrary negative cycle in a graph using the Bellman-Ford algorithm with the SPFA heuristic.