code: def test_unfeasible():
      G = tarjan_bridge_graph()
      pytest.raises(
          nx.NetworkXUnfeasible,
          list,
          k_edge_augmentation(G, k=1, avail=[]),
      )
  
      pytest.raises(
          nx.NetworkXUnfeasible,
          list,
          k_edge_augmentation(G, k=2, avail=[]),
      )
  
      pytest.raises(
          nx.NetworkXUnfeasible,
          list,
          k_edge_augmentation(G, k=2, avail=[(7, 9)]),
      )
  
      # partial solutions should not error if real solutions are infeasible
      aug_edges = list(
          k_edge_augmentation(G, k=2, avail=[(7, 9)], partial=True)
      )
      assert aug_edges == [(7, 9)]
  
      _check_augmentations(G, avail=[], max_k=MAX_EFFICIENT_K + 2)
  
      _check_augmentations(G, avail=[(7, 9)], max_k=MAX_EFFICIENT_K + 2)
  
imports: import itertools
  import random
  import pytest
  import networkx
  from networkx.algorithms.connectivity import k_edge_augmentation
  from networkx.algorithms.connectivity.edge_augmentation import _unpack_available_edges, collapse, complement_edges, is_k_edge_connected, is_locally_k_edge_connected
  from networkx.utils import pairwise
label_desc: Use image node_id 13 for calling a global function with example usage: test_unfeasible() without return types