These are the functions to get flows in networks:
| Function | Short Description | |
| MaximumFlow | maximum flow through a network | |
| MinimumCostFlow | maximum flow through a network at minimum cost (weight) |
The facing column contains an example for MinimumCostFlow, the graphics shows for every edge its flow and its weight.