MCPcopy Create free account
hub / github.com/EbTech/rust-algorithms / mcf_search

Method mcf_search

src/graph/flow.rs:158–178  ·  view source on GitHub ↗

Maintains Johnson's potentials to prevent negative-cost residual edges. This allows running Dijkstra instead of the slower Bellman-Ford.

(&self, s: usize, flow: &[i64], pot: &mut [i64])

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

mcfMethod · 0.80

Calls 2

num_vMethod · 0.80
adj_listMethod · 0.80

Tested by

no test coverage detected