Class edge

code/graph/edmonds_karps.cpp:4–6

int q[MAXV], p[MAXV], d[MAXV];
struct flow_network {
  struct edge { int v, nxt, cap;
    edge(int _v, int _cap, int _nxt)
      : v(_v), nxt(_nxt), cap(_cap) { } };
  int n, *head; vector<edge> e, e_store;
  flow_network(int _n) : n(_n) {
    memset(head = new int[n], -1, n*sizeof(int)); }