code: def minimum_edge_weight(self, T, u, v):
      path = nx.shortest_path(T, u, v, weight="weight")
      return min(
          (T[u][v]["weight"], (u, v)) for (u, v) in zip(path, path[1:])
      )
  
file_path: networkx/networkx/algorithms/flow/tests/test_gomory_hu.py
imports: from itertools import combinations
  import pytest
  import networkx
  from networkx.algorithms.flow import boykov_kolmogorov, dinitz, edmonds_karp, preflow_push, shortest_augmenting_path
label_desc: Use image node_id 1 for calling the TestGomoryHuTree obj's underlying member method code with example usage: obj.minimum_edge_weight(T, u, v) and returns: min