Maple Student Edition
Maple Personal Edition
Maple Player for iPad
Maple T.A. MAA Placement Test Suite
Maple T.A. Connector for Blackboard Software
Möbius Project Home Page
View Math Apps
Machine Design / Industrial Automation
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Other Application Areas
High Schools & Two-Year Colleges
Testing & Assessment
High Performance Computing
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
networks[dinic] - augmenting-path flow algorithm
dinic(G, s, t, eset, comp)
dinic(G, s, t, eset, comp, n)
graph or network
source vertex for the flow
sink vertex for the flow
name to return the set of saturated edges
name to return the set of vertices in eset
integer upper bound for the flow
Important: The networks package has been deprecated. Use the superseding package GraphTheory instead.
This routine returns the maximum flow from s to t in G. It is normally called by the routine flow() which performs some setup and preliminary analysis based on edge-connectivity calculations.
Edge weights of G are interpreted as capacities.
If a non-negative integer upper bound n is specified for the flow then the routine terminates after a flow of n in G is found even if greater flows are possible.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[dinic](...).
GraphTheory, networks(deprecated)[shortpathtree], networks(deprecated)[spantree]
Download Help Document