class_docstr: Base class for test classes for minimum spanning tree algorithms.
  This class contains some common tests that will be inherited by
  subclasses. Each subclass must have a class attribute
  :data:`algorithm` that is a string representing the algorithm to
  run, as described under the ``algorithm`` keyword argument for the
  :func:`networkx.minimum_spanning_edges` function.  Subclasses can
  then implement any algorithm-specific tests.
class_docstr_tok: ["Base","class","for","test","classes","for","minimum","spanning","tree","algorithms",".","This","class","contains","some","common","tests","that","will","be","inherited","by","subclasses",".","Each","subclass","must","have","a","class","attribute",":","data",":","`","algorithm","`","that","is","a","string","representing","the","algorithm","to","run",",","as","described","under","the","``","algorithm","``","keyword","argument","for","the",":","func",":","`","networkx.minimum_spanning_edges","`","function",".","Subclasses","can","then","implement","any","algorithm-specific","tests","."]
code: def test_disconnected(self):
      G = nx.Graph([(0, 1, {"weight": 1}), (2, 3, {"weight": 2})])
      T = nx.minimum_spanning_tree(G, algorithm=self.algo)
      assert nodes_equal(list(T), list(range(4)))
      assert edges_equal(list(T.edges()), [(0, 1), (2, 3)])
  
imports: import pytest
  import networkx
  from networkx.utils import edges_equal, nodes_equal
label_desc: Use image node_id 11 for calling the MinimumSpanningTreeTestBase obj's underlying member method code with example usage: obj.test_disconnected() without return types