MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / edge

Class edge

code/graph/dinic.cpp:4–6  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

2int q[MAXV], d[MAXV];
3struct flow_network {
4 struct edge { int v, nxt, cap;
5 edge(int _v, int _cap, int _nxt)
6 : v(_v), nxt(_nxt), cap(_cap) { } };
7 int n, *head, *curh; vector<edge> e, e_store;
8 flow_network(int _n) : n(_n) {
9 curh = new int[n];

Callers 1

add_edgeMethod · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected