JAVENGA Network Flow
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Baloukas Athanasios |
||||
Institution |
University of Macedonia, Department of Applied Informatics, Thessaloniki, Greece |
||||
Project |
JAVENGA |
||||
Works |
Yes |
||||
Description |
The software features static visualizations for Graph and Network Algorithms. More specifically it illustrates: BFS and DFS traversals; topological sorting; various shortest path algorithms; Minimum Spanning tree algorithms of Prim and Kruskal; and the Primal Network Simplex Algorithm for the balanced Minimum Cost Network Flow Problem. There are two versions of the network flow algorithm. They do the same thing, but one has a smoother animation. Once a graph is entered, select one of the versions of the Network Simplex visualization. Then either repeatedly click the "Step Forward" button, or set the speed and click the "Run Algorithm" button. |
||||
Evaluation |
|
||||
|
|||||
Teaching the Concept; Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|||||
You can use this as a Java Applet (click on link above) or get the Java .jar file at http://users.uom.gr/~thanasis/JAVENGA.html. When you open the applet, you must first enter a graph using the graphical editor (first 3 buttons at the top). You can view the graph representation (4th button). You can choose an algorithm to run (rightmost button at top). You must enter a graph first. The network flow algorithm requires that the graph be balanced. That is, the weights on the nodes must sum to zero. |
|||||
First Visited |
2009-09-02 |
||||
Last Visited |
2009-09-02 |
||||
Last Updated |
2009 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
