code: def compute_cutset(G, partition):
      reachable, non_reachable = partition
      cutset = set()
      for u, nbrs in ((n, G[n]) for n in reachable):
          cutset.update((u, v) for v in nbrs if v in non_reachable)
      return cutset
  
imports: import pytest
  import networkx
  from networkx.algorithms.flow import boykov_kolmogorov, build_flow_dict, build_residual_network, dinitz, edmonds_karp, preflow_push, shortest_augmenting_path
label_desc: Use image node_id 1 for calling a global function with example usage: compute_cutset(G, partition) and returns: cutset