MCPcopy Create free account
hub / github.com/VastoLorde95/Competitive-Programming / augment

Method augment

Library/MinCostMaxFlow.cc:62–90  ·  view source on GitHub ↗

Note: In SSSP, the distance from the source 's' to 'v' is dist[v] + phi[v] - phi[x]

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 2

emptyMethod · 0.80
insertMethod · 0.45

Tested by

no test coverage detected