A Free Educational Java Framework for Graph Algorithms

Free registration required

Executive Summary

In the teaching of graph theory algorithms it is important that students can experiment them on numerical instances in order to fully understand their logical meaning and to learn how they can be implemented. The framework, which is currently in use at the University of Bologna, and is available on-line, presently includes four basic algorithms in graph theory, for the solution the following problems: shortest spanning tree, shortest paths, maximum flow, and critical path. It includes an intuitive graphical user interface, and gives the users the possibility of performing a "Step-By-Step" execution.

  • Format: PDF
  • Size: 71.1 KB