Computes the shortest paths between ALL pairs of nodes simultaneously in a weighted graph using a 2D matrix dynamic programming approach.