Function name: floyd
Description:

The Floyd-Warshall algorithm is designed to find the shortest path (if it exists) between two nodes in a graph.

Authors: John Burkardt and Manos Papadakis