Algorithm $3\mathrm{.}4$

Floyd's Algorithm for Shortest Paths $2$

Problem: Same as in Algorithm $3\mathrm{.}3,$ except shortest paths are also created.

Additional outputs: an array $P,$ which has both its rows and columns indexed

from $1$ to $n,$ whereCan Floyd's Algorithm $2($Algorithm $3\mathrm{.}4)$ for solving the shortest path problem be used in a graph with negative weights? Explain why or why not.