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

Class cmp

code/graph/edmonds_karps_mcmf.cpp:3–4  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1#define MAXV 2000
2int d[MAXV], p[MAXV], pot[MAXV];
3struct cmp { bool operator()(int i, int j) const {
4 return d[i] == d[j] ? i < j : d[i] < d[j]; } };
5struct flow_network {
6 struct edge { int v, nxt, cap, cost;
7 edge(int _v, int _cap, int _cost, int _nxt)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected