Recommendation

Has Potential

Link

http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/maxflow/Maxflow.shtml

Delivery Method

Java Applet

License

Unlicensed Sourcecode

Language

English

Author

Kenji Ikeda

Institution

Tokushima University

Project

StandAlone

RelationshipToProject

StandAlone

Works

Yes

Description

The web page states the maximum flow and minimum cut problem and describes the Ford-Fulkerson algorithm to find the maximum flow. The description is followed by a series of links to examples each of which points to a fixed graph. The example page displays an applet containing the graph and the residual graph. The graph displays the flow on the edge and the capacity of the edge. The residual graph displays the flow on each edge. The user can step through the algorithm by clicking on the graph. On clicking the graph, a path from the source to the sink is highlighted and the flow values along the path are updated. The residual graph is appropriately updated.

Evaluation

This simple applet explains the maximum flow problem reasonably well. The graphs are clearly laid out. The idea of separating the graph from the residual graph works to prevent confusion. The color scheme is satisfactory. On completion, the applet cycles back to the start on a mouse click. Clearly signaling the end of the algorithm would better help the uninitiated. While the visualization rightly does away with a lot of unnecessary customization related options, more modes of interactivity could immensely improve the user's productivity. For example, the user could be asked to identify an s-t path or fill in the flow values on the edges. In this visualization, user interactivity is limited to stepping through the algorithm. For this particular algorithm, a previous button could be helpful. Supporting explanation text would definitely aid understanding.The examples could be integrated into a single applet (the user could choose a particular example form a drop down box).

ActivityLevel

GoodFor

Lecture Aid

Screenshots

Videos

References

HowToUse

First Visited

2008-04-06

Last Visited

2008-04-06

Last Updated

2006-06-26

Topic

NetworkFlow

Community

Edit

You may edit this entry if you have an account.