code: def test_max_iter_argument():
      G = nx.Graph(
          [
              ("A", "B", {"weight": 1}),
              ("A", "C", {"weight": 2}),
              ("A", "D", {"weight": 3}),
              ("A", "E", {"weight": 2}),
              ("A", "F", {"weight": 4}),
              ("B", "C", {"weight": 1}),
              ("B", "D", {"weight": 4}),
              ("B", "E", {"weight": 2}),
              ("B", "F", {"weight": 1}),
              ("C", "D", {"weight": 3}),
              ("C", "E", {"weight": 2}),
              ("C", "F", {"weight": 1}),
              ("D", "E", {"weight": 4}),
              ("D", "F", {"weight": 3}),
              ("E", "F", {"weight": 2}),
          ]
      )
      partition = ({"A", "B", "C"}, {"D", "E", "F"})
      C = kernighan_lin_bisection(G, partition, max_iter=1)
      assert_partition_equal(C, ({"A", "F", "C"}, {"D", "E", "B"}))
  
file_path: networkx/networkx/algorithms/community/tests/test_kernighan_lin.py
imports: from itertools import permutations
  import pytest
  import networkx
  from networkx.algorithms.community import kernighan_lin_bisection
label_desc: Use image node_id 9 for calling a global function with example usage: test_max_iter_argument() without return types