class_docstr: Tests the spanning tree iterator on the example graph in the 2005 Sörensen
  and Janssens paper An Algorithm to Generate all Spanning Trees of a Graph in
  Order of Increasing Cost
class_docstr_tok: ["Tests","the","spanning","tree","iterator","on","the","example","graph","in","the","2005","S\u00f6rensen","and","Janssens","paper","An","Algorithm","to","Generate","all","Spanning","Trees","of","a","Graph","in","Order","of","Increasing","Cost"]
docstr: Tests that the spanning trees are correctly returned in decreasing order
docstr_tok: ["Tests","that","the","spanning","trees","are","correctly","returned","in","decreasing","order"]
code: def test_maximum_spanning_tree_iterator(self):
      """
      Tests that the spanning trees are correctly returned in decreasing order
      """
      tree_index = 7
      for tree in nx.SpanningTreeIterator(self.G, minimum=False):
          actual = sorted(tree.edges(data=True))
          assert edges_equal(actual, self.spanning_trees[tree_index])
          tree_index -= 1
  
imports: import pytest
  import networkx
  from networkx.utils import edges_equal, nodes_equal
label_desc: Use image node_id 3 for calling the TestSpanningTreeIterator obj's underlying member method code with example usage: obj.test_maximum_spanning_tree_iterator() without return types