Path Finding Methods: "Manually Enter" helps you flexibly try any path from source to sink
1. BFS: Find a path from source to sink with the fewest number of edges. See BFS animation
here
2. Greedy-DFS: The adjacent edges are sorted in descending order by weight(capacity).
3. DFS: Standard DFS. See DFS animation
here
4. Modified Dijkstra: Find the path from source to sink that has the max flow.
5. Manually Enter: Enter node ids on the path from source to sink where node ids are separated by space(s).
API Explanations:
1. Run Augmenting Path: Find a path from
source to
sink based on the selected path finding method and process it
2. Find Minimum Cut: Find a set of edges that disconnect the
source
and
sink and has the smallest total weight(capacity)