Result: shortest paths between all pairs of vertices

• dist[][] V×V-indexed matrix of cost of shortest path from v_row to v_col
• path[][] V×V-indexed matrix of next node in shortest path from v_row to v_col