| |
| |
| |
GraphsJ 3 � A modern didactic application for graph
algorithms
GraphsJ 2 - Open source Java application for graph
algorithms
- GraphsJ 3 is the most recent version, but it only includes the applets for shortest spanning tree (Prim),
shortest paths (Dijkstra), min-cost flow (Ford-Fulkerson), and Critical Path Method (CPM).
- GraphsJ 2 (recommended) includes the same applets, plus the TSP applets (Nearest Neighbor, Multi-fragment,
Two-opt, and 2-Approx) and the enumerative algorithm for the Hamiltonian circuit.
In case of troubles with Java, add address `http://www.or.deis.unibo.it' to the exceptions list
(Control panel----> Programs ---->Java(32 bit)---->Security---->Edit Site List---->Add---->insert the address)