Answer: (ii) Floyd-Warshall's Algorithm

Explanation:

• All-Pairs Shortest Path (APSP) = shortest distances between every pair $(i,j)$.
• Floyd-Warshall: DP, $\Theta(V^3)$, handles negative edges (no negative cycles), simple triple loop: dist[k][i][j]=min(dist[k-1][i][j], dist[k-1][i][k]+dist[k-1][k][j]).
• Dijkstra's = Single-Source Shortest Path for non-negative weights; to get APSP you must run it $V$ times → $O(V E \log V)$, but not the canonical APSP algorithm.
• Prim's / Kruskal's = MST algorithms, unrelated to shortest paths.

Correct choice: (ii) Floyd's Warshall's (also Johnson's algorithm is another APSP method).