JAVENGA Graph Traversals
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. After drawing a graph, the user can select DFS or BFS traversal from the "Solve a Problem" menu. Users can either set the pace of the animation, or click the "Step Forward" button to advance the process. The message pane on the right side describes the steps taking place. |
||||
Evaluation |
|
||||
User Data; Step Control |
|||||
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). This version of the software will not let you run an algorithm until a graph has been created. That might be changed in the future. |
|||||
First Visited |
2009-09-12 |
||||
Last Visited |
2009-09-15 |
||||
Last Updated |
2009 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
