Write a function for finding the shortest cyclic path for every node of a directed and weighted graph. Prototype of a function is
void path(double adj_matrix[n]);
Print nodes with length of every path.
For nodes which don't have cyclic path, lenght is -1.
How to modify Floyd Warshall's algorithms in order to find the shortest cyclic path?