Next: 5.4 Other computations
Up: 5. Computations on graphs
Previous: 5.2 Graph computations
These functions make computations on networks. This means that the
graph has capacities and/or costs values on the edges.
- max_cap_path
- maximum capacity path
- max_flow
- maximum flow between two nodes
- min_lcost_cflow
- minimum linear cost constrained flow
- min_lcost_flow1
- minimum linear cost flow
- min_lcost_flow2
- minimum linear cost flow
- min_qcost_flow
- minimum quadratic cost flow
- pipe_network
- pipe network problem
Next: 5.4 Other computations
Up: 5. Computations on graphs
Previous: 5.2 Graph computations
Scilab Group