code: def test_all_pairs_shortest_path(self):
      graph = [
          [0, 0.1, 0.101, 0.142, 0.277],
          [0.465, 0, 0.191, 0.192, 0.587],
          [0.245, 0.554, 0, 0.333, 0.931],
          [1.032, 0.668, 0.656, 0, 0.151],
          [0.867, 0.119, 0.352, 0.398, 0],
      ]
      result = all_pairs_shortest_path(graph)
  
      self.assertEqual(
          result,
          [
              [0, 0.1, 0.101, 0.142, 0.277],
              [0.436, 0, 0.191, 0.192, 0.34299999999999997],
              [0.245, 0.345, 0, 0.333, 0.484],
              [0.706, 0.27, 0.46099999999999997, 0, 0.151],
              [0.5549999999999999, 0.119, 0.31, 0.311, 0],
          ],
      )
  
imports: from algorithms.graph import Tarjan
  from algorithms.graph import check_bipartite
  from algorithms.graph.dijkstra import Dijkstra
  from algorithms.graph import ford_fulkerson
  from algorithms.graph import edmonds_karp
  from algorithms.graph import dinic
  from algorithms.graph import maximum_flow_bfs
  from algorithms.graph import maximum_flow_dfs
  from algorithms.graph import all_pairs_shortest_path
  from algorithms.graph import bellman_ford
  from algorithms.graph import count_connected_number_of_component
  from algorithms.graph import prims_minimum_spanning
  from algorithms.graph import check_digraph_strongly_connected
  from algorithms.graph import cycle_detection
  from algorithms.graph import find_path
  from algorithms.graph import path_between_two_vertices_in_digraph
  import unittest
label_desc: Use image node_id 1 for calling the TestAll_Pairs_Shortest_Path obj's underlying member method code with example usage: obj.test_all_pairs_shortest_path() without return types