A flow on a graph is an assignment to each edge of of a direction and a non-negative integer (the flow in that edge) such that the flows into and out of each vertex agree. A flow is nowhere zero if every edge is carrying a positive flow and (confusingly) it is a -flow if the flows …