EDGE Algorithms

Maximum Flow (Push-Relabel)  ›  interactive tensor walkthrough

Graph

on each edge F(u,v) / C(u,v) — flow carried, out of capacity  ·  on each node d= distance D(u), e= excess E(u)
active vertex (in Act) sourcesink touched this step
stored 0 empty — what empty means is per tensor, so every grid carries its declared value as ∅ 0, ∅ +∞ or ∅ false positivenegative true

Static tensors — no rank I; never change

capacity