class_docstr: Unit tests for computing a minimum (or maximum) spanning tree
  using Borůvka's algorithm.
class_docstr_tok: ["Unit","tests","for","computing","a","minimum","(","or","maximum",")","spanning","tree","using","Bor\u016fvka","'s","algorithm","."]
docstr: Tests that using a Unicode string can correctly indicate
  Borůvka's algorithm.
docstr_tok: ["Tests","that","using","a","Unicode","string","can","correctly","indicate","Bor\u016fvka","'s","algorithm","."]
code: def test_unicode_name(self):
      """Tests that using a Unicode string can correctly indicate
      Borůvka's algorithm.
      """
      edges = nx.minimum_spanning_edges(self.G, algorithm="borůvka")
      # Edges from the spanning edges functions don't come in sorted
      # orientation, so we need to sort each edge individually.
      actual = sorted((min(u, v), max(u, v), d) for u, v, d in edges)
      assert edges_equal(actual, self.minimum_spanning_edgelist)
  
imports: import pytest
  import networkx
  from networkx.utils import edges_equal, nodes_equal
label_desc: Use image node_id 1 for calling the TestBoruvka obj's underlying member method code with example usage: obj.test_unicode_name() without return types