Crate all_shortest_path

Floyd–Warshall Algorithm implementation. See: https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm

Functions

all_shortest_path

Floyd-Warshall Algorithm implementation. The input matrix is expected to be the square adjacent matrix of the graph. When there is no direct connection between two nodes, the value associated is T::max_value(). Function assumes that g is a square matrix. Panics otherwise.

Type Definitions

FWResult

Simple type alias. Useful for shorter function signature. The first item is the distance matrix, the second is the successor matrix.