Which one of the following algorithm design techniques is used in finding all…

The Floyd-Warshall algorithm is the standard approach for finding all-pairs shortest paths in a weighted graph. It operates using dynamic programming by iteratively improving path estimates through intermediate vertices. Unlike greedy algorithms (like Dijkstra) which typically handle single-source paths, or backtracking methods used for constraint satisfaction, dynamic programming is the core technique here.