Floyd-Warshall Shortest Path Algorithm

Contains 3 different implementations of Floyd-Warshall algorithm in C:

1. Recursive
2. Recursive with memorisation
3. Dynamic Programming (with path reconstruction)
   *To disable path reconstruction comment the line "#DEFINE PATH".
   
   

Input

• Number of nodes
• Distance of:
  node1->node0
  node2->node1    node2->node0
  node3->node2    node3->node1    node3->node0
  (0 if there is no path)

Example:
5
3
1 0
2 4 7
3 0 0 8