An example of a small network flow input.
Format
A list containing 5 elements. This 32 node graph contains 274 edges/arcs. This information is encoded in the first four elements of the list.
startnodes
andendnodes
contains the start and end node for each edge/arc.arccosts
andarcapacity
contain the cost and capacity of each edge/arc.nodedemand
contains the demand for each of the 32 nodes.