Dijkstra’s Algorithm

This project show the shortest path to the target.

Dijkstra's Map

How to :
The input parameter is
1. Uwajima
2. Matsuyama
3. Nakamura
4. Kochi
5. Kawanoe
6. Ikeda
7. Takamatsu
8. Tokushima
9. Muroto
Enter the start and end to get the answer.

Tools & Knowledge :
1. C++
2. dijkstra algorithm

Reqirement :
1. Microsoft .Net Framework 2.0 (22.4 MB)
2. windows

Download :
1. Dijkstra’s algorithm (exe)
2. Dijkstra’s algorithm (source code)