returns the value of a maximum flow through graph g from source to sink.
returns the edges in g that have positive flow, along with their flows, in a maximum flow from source to sink.
returns a minimum cut between source and sink.
returns the adjacency list of g along with flows on each edge in a maximum flow from source to sink.
Basic Examples (2)
NetworkFlow has been superseded by FindMaximumFlow:
- Graph Algorithms
- Combinatorica Package
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics