Network Flow
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Thanarat Horprasert Chalidabhongse |
||||
Institution |
University of Maryland |
||||
Project |
|||||
Works |
Yes |
||||
Description |
The applet lets the user construct an input for the Network Flow problem using a graphical user interface and execute the Ford-Fulkerson algorithm on it in one go or one augmenting path at a time. The visualisation displays the graph and the associated flows and capacities. |
||||
Evaluation |
The graphical representations used are clear and mostly obvious. The applet does not explain the algorithm in detail; after each step, it simply displays the current flow through the network. In other words, it provides little assistance in understanding how augmenting paths are chosen; in fact, it does not even explicitly display the augmenting paths. Therefore, some familiarity with the algorithm is likely to be helpful in making use of the applet. It is rather a nuisance that the only option is to enter your own graph, with no good examples provided. |
||||
|
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2007-09-26 |
||||
Last Visited |
2007-09-26 |
||||
Last Updated |
1996 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
