JGraphs


General Info

JGraphs is a simple Java program to demonstrate algorithms on graphs. It will go through each algorithm in a step-by-step manner, to make the core functionality as transparent to the user as possible.

Currently only "Single-Source shortest Paths" algorithms are implemented, but that may change in the future. That is, from a given vertice the shortest distances to all the other vertices are sought. The algorithms used to solve this problem are commonly referred to as Dijkstra and Bellman-Ford.

JGraphs is released under the terms of the GNU General Public License. It was written from scratch and is maintained by Andreas Bauer. For more information, see the COPYING file provided with the JGraphs program.


Download

You can download the JGraphs source code and documentation - all tarred up nicely - by following this link:


Documentation

All necessary documentation is included in the JGraphs distribution tarball. If you are interested in a more in depth explanation of the deployed algorithms, you should grab your favourite books on graph algorithms and look up the terms Dijkstra and Bellman-Ford.

Alternatively you can also have a look at some slides that I used for a quick presentation of JGraphs in the Fundamental Algorithms lecture at TUM:


Screenshots

Everyone loves screenshots, right? So here is my bit; and please look at the bottom part, too. It contains program output.


Andreas Bauer, <baueran@in.tum.de>
Last modified: Mon Jun 17 11:37:06 2002
Valid HTML 4.0