class_docstr: Unit tests for computing a minimum (or maximum) spanning tree
  using Prim's algorithm.
class_docstr_tok: ["Unit","tests","for","computing","a","minimum","(","or","maximum",")","spanning","tree","using","Prim","'s","algorithm","."]
code: def test_prim_mst_edges_simple_graph(self):
      H = nx.Graph()
      H.add_edge(1, 2, key=2, weight=3)
      H.add_edge(3, 2, key=1, weight=2)
      H.add_edge(3, 1, key=1, weight=4)
  
      mst_edges = nx.minimum_spanning_edges(
          H, algorithm=self.algo, ignore_nan=True
      )
      assert edges_equal(
          [
              (1, 2, {"key": 2, "weight": 3}),
              (2, 3, {"key": 1, "weight": 2}),
          ],
          list(mst_edges),
      )
  
imports: import pytest
  import networkx
  from networkx.utils import edges_equal, nodes_equal
label_desc: Use image node_id 1 for calling the TestPrim obj's underlying member method code with example usage: obj.test_prim_mst_edges_simple_graph() without return types