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.
A proof involving feasible potentials and dicycles is provided.