Let D = (V; A) be a digraph, and s and t be two distinct nodes in V . Show that D has no s-t path if and only if there exists a nonnegative integer-valued labeling p of the nodes satisfying that p (s) = n and p (t) = 0; for each (u; v) 2 A, p (u) p (v) 1