JAVENGA Graph Representations
|
- Works?
- Yes
- Delivery Method(s)
- Java Applet
- Project
- JAVENGA
- Project Relationship
- Part of project
- Language(s)
- English
- Baloukas Athanasios
- Institution(s)
- University of Macedonia, Department of Applied Informatics, Thessaloniki, Greece
- Activity Level(s)
- N/A
- Source Code License
- Unavailable
- First Published
- N/A
- Last Modified
- N/A
- 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.
- Evaluation
- Usage Notes
- 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). It doesn’t appear that you can run an algorithm until you have actually created a graph using the editor.
- Field Report(s)
- References
- N/A
- AV of the Day
- No
- Score
- 25
