Description: Is mainly to solve a process of in travel costs, the key is to use Dijkstra algorithm to solve Europe between the two cities the cheapest travel routes, and to take the shortest, path distance and the city had displayed.
To Search:
File list (Check if you may need any files):
for experiment5\DB5\DB5.dsp
...............\...\DB5.dsw
...............\...\DB5.ncb
...............\...\DB5.opt
...............\...\DB5.plg
...............\...\.ebug\DB5.exe
...............\...\.....\DB5.ilk
...............\...\.....\DB5.pch
...............\...\.....\DB5.pdb
...............\...\.....\main.obj
...............\...\.....\RailSystem.obj
...............\...\.....\vc60.idb
...............\...\.....\vc60.pdb
...............\...\services.txt
...............\handout-files5\City.h
...............\..............\main.cpp
...............\..............\RailSystem.cpp
...............\..............\RailSystem.h
...............\..............\Service.h
...............\..............\services.txt
...............\DB5\Debug
...............\DB5
...............\handout-files5
for experiment5
Download