Function main

Graph Theory/Dinics Algorithm.cpp:75–86

  }
};
int main() {
  int n, m;
  cin >> n >> m;
  Dinic F(n + 1);
  for (int i = 1; i <= m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    F.add_edge(u, v, w);
  }
  cout << F.max_flow(1, n) << '\n';
  return 0;
}