code: def test_multigraph(self):
      assert nx.bellman_ford_path(self.MXG, "s", "v") == [
          "s",
          "x",
          "u",
          "v",
      ]
      assert nx.bellman_ford_path_length(self.MXG, "s", "v") == 9
      assert nx.single_source_bellman_ford_path(self.MXG, "s")["v"] == [
          "s",
          "x",
          "u",
          "v",
      ]
      assert (
          nx.single_source_bellman_ford_path_length(self.MXG, "s")["v"]
          == 9
      )
      D, P = nx.single_source_bellman_ford(self.MXG, "s", target="v")
      assert D == 9
      assert P == ["s", "x", "u", "v"]
      P, D = nx.bellman_ford_predecessor_and_distance(self.MXG, "s")
      assert P["v"] == ["u"]
      assert D["v"] == 9
      P, D = nx.goldberg_radzik(self.MXG, "s")
      assert P["v"] == "u"
      assert D["v"] == 9
      assert nx.bellman_ford_path(self.MXG4, 0, 2) == [0, 1, 2]
      assert nx.bellman_ford_path_length(self.MXG4, 0, 2) == 4
      assert nx.single_source_bellman_ford_path(self.MXG4, 0)[2] == [
          0,
          1,
          2,
      ]
      assert (
          nx.single_source_bellman_ford_path_length(self.MXG4, 0)[2]
          == 4
      )
      D, P = nx.single_source_bellman_ford(self.MXG4, 0, target=2)
      assert D == 4
      assert P == [0, 1, 2]
      P, D = nx.bellman_ford_predecessor_and_distance(self.MXG4, 0)
      assert P[2] == [1]
      assert D[2] == 4
      P, D = nx.goldberg_radzik(self.MXG4, 0)
      assert P[2] == 1
      assert D[2] == 4
  
imports: import pytest
  import networkx
  from networkx.utils import pairwise
label_desc: Use image node_id 13 for calling the TestBellmanFordAndGoldbergRadzik obj's underlying member method code with example usage: obj.test_multigraph() without return types