Some problems impose capacity limits on nodes, not edges. For example, a node can handle at most units of flow. Convert vertex capacity to edge capacity: split each node into two nodes and .
Add an edge with capacity . All incoming edges go to , all outgoing edges leave from . This enforces the vertex capacity constraint.