code: def test_digraph_infcap_edges(self):
      # DiGraph with infinite capacity edges
      G = nx.DiGraph()
      G.add_edge("s", "a")
      G.add_edge("s", "b", capacity=30)
      G.add_edge("a", "c", capacity=25)
      G.add_edge("b", "c", capacity=12)
      G.add_edge("a", "t", capacity=60)
      G.add_edge("c", "t")
  
      H = {
          "s": {"a": 85, "b": 12},
          "a": {"c": 25, "t": 60},
          "b": {"c": 12},
          "c": {"t": 37},
          "t": {},
      }
  
      compare_flows_and_cuts(G, "s", "t", H, 97)
  
      # DiGraph with infinite capacity digon
      G = nx.DiGraph()
      G.add_edge("s", "a", capacity=85)
      G.add_edge("s", "b", capacity=30)
      G.add_edge("a", "c")
      G.add_edge("c", "a")
      G.add_edge("b", "c", capacity=12)
      G.add_edge("a", "t", capacity=60)
      G.add_edge("c", "t", capacity=37)
  
      H = {
          "s": {"a": 85, "b": 12},
          "a": {"c": 25, "t": 60},
          "c": {"a": 0, "t": 37},
          "b": {"c": 12},
          "t": {},
      }
  
      compare_flows_and_cuts(G, "s", "t", H, 97)
  
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 9 for calling the TestMaxflowMinCutCommon obj's underlying member method code with example usage: obj.test_digraph_infcap_edges() without return types