Question

Design and Analysis of Algorithm : Following is the algorithm to find all pairs shortest path in a weighted directed graph, where W[][] is adjacency matrix with weights. ALGORITHM Floyd(W[1..n, 1..n]) //Implements Floyd's algorithm for the all-pairs shortest-paths problem //Input: The weight matrix W of a graph with no negative-length cycle //Output: The distance matrix of the shortest paths' lengths D ? W //is not necessary if W can be overwritten for k ? 1 to n do for i ? 1 to n do for j ? 1 to n do D[i, j] ? min\{D[i, j], D[i, k] + D[k, j]\} return D Develop an algorithm to find all pairs longest path in a weighted directed graph.

          Design and Analysis of Algorithm
: Following is the algorithm to find all pairs shortest path in a weighted directed graph, where W[][] is
adjacency matrix with weights.
ALGORITHM Floyd(W[1..n, 1..n])
//Implements Floyd's algorithm for the all-pairs shortest-paths problem
//Input: The weight matrix W of a graph with no negative-length cycle
//Output: The distance matrix of the shortest paths' lengths
D ? W //is not necessary if W can be overwritten
for k ? 1 to n do
  for i ? 1 to n do
    for j ? 1 to n do
      D[i, j] ? min\{D[i, j], D[i, k] + D[k, j]\}
return D
Develop an algorithm to find all pairs longest path in a weighted directed graph.

Design and Analysis of Algorithm
: Following is the algorithm to find all pairs shortest path in a weighted directed graph, where W[][] is
adjacency matrix with weights.
ALGORITHM Floyd(W[1..n, 1..n])
//Implements Floyd's algorithm for the all-pairs shortest-paths problem
//Input: The weight matrix W of a graph with no negative-length cycle
//Output: The distance matrix of the shortest paths' lengths
D ? W //is not necessary if W can be overwritten
for k ? 1 to n do
for i ? 1 to n do
for j ? 1 to n do
D[i, j] ? min{D[i, j], D[i, k] + D[k, j]}
return D
Develop an algorithm to find all pairs longest path in a weighted directed graph.

Added by Deanna B.

Question

Please give Ace some feedback