code: def test_wikipedia_dinitz_example(self):
      # Nice example from https://en.wikipedia.org/wiki/Dinic's_algorithm
      G = nx.DiGraph()
      G.add_edge("s", 1, capacity=10)
      G.add_edge("s", 2, capacity=10)
      G.add_edge(1, 3, capacity=4)
      G.add_edge(1, 4, capacity=8)
      G.add_edge(1, 2, capacity=2)
      G.add_edge(2, 4, capacity=9)
      G.add_edge(3, "t", capacity=10)
      G.add_edge(4, 3, capacity=6)
      G.add_edge(4, "t", capacity=10)
  
      solnFlows = {
          1: {2: 0, 3: 4, 4: 6},
          2: {4: 9},
          3: {"t": 9},
          4: {3: 5, "t": 10},
          "s": {1: 10, 2: 9},
          "t": {},
      }
  
      compare_flows_and_cuts(G, "s", "t", solnFlows, 19)
  
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 7 for calling the TestMaxflowMinCutCommon obj's underlying member method code with example usage: obj.test_wikipedia_dinitz_example() without return types