Let G be a directed graph where c_e is the cost of arc e. If the nodes of G can be assigned feasible potentials then G has no negative dicycle.
Assume G has feasible potentials. Let y_v be the potential assigned to node v.
In particular then for any ...
A proof involving feasible potentials and dicycles is provided.