This module provides support for the classical shortest path problem. It is envisaged that it will cover a number of the common versions of the problem, including solution algorithms.
At present we offer the following:
- A simple user interface for the problem itslef.
- An interactive dynamic programming based interactive computing facility for solving shortest path problems that possess no cycles.
| Contributed by |