Recommendation

Unrated

Link

http://users.uom.gr/~thanasis/JAVENGA.html

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Baloukas Athanasios

Institution

University of Macedonia, Department of Applied Informatics, Thessaloniki, Greece

Project

JAVENGA

RelationshipToProject

PartOfProject

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.

Evaluation

ActivityLevel

GoodFor

Teaching the Concept; Exploring the Concept

Screenshots

Videos

References

HowToUse

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.

First Visited

2009-09-02

Last Visited

2009-09-02

Last Updated

2009

Topic

GraphRepresentations

Community

Edit

You may edit this entry if you have an account.