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

Method reset

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

Source from the content-addressed store, hash-verified

9 curh = new int[n];
10 memset(head = new int[n], -1, n*sizeof(int)); }
11 void reset() { e = e_store; }
12 void add_edge(int u, int v, int uv, int vu=0) {
13 e.push_back(edge(v,uv,head[u])); head[u]=(int)size(e)-1;
14 e.push_back(edge(u,vu,head[v])); head[v]=(int)size(e)-1;}

Callers 1

construct_gh_treeFunction · 0.45

Calls

no outgoing calls

Tested by

no test coverage detected