em-29 directed graph G = (V,E), where V = {1,2,...,n}. Find the shortest path between any pair of nodes in the graph. Assume the weights are represented in the matrix C[V][V], where C [i] [j]...

Machine independent language If you don't have knowledge skip it Thanks

Extracted text: em-29 directed graph G = (V,E), where V = {1,2,...,n}. Find the shortest path between any pair of nodes in the graph. Assume the weights are represented in the matrix C[V][V], where C [i] [j] indicates the weight (or cost) between the nodes i and j. Also, C[i][j] = ∞ or -1 if there is no path from node i to node j. All Pairs Shortest Path Problem: Floyd's Algorithm: Given a weighted %3D