Description: Romania holiday issue
I. problem description
Respectively, consistent with the cost of the breadth and the depth is limited priority (default search), greedy algorithm, A* algorithm Romania holidays . Bucharest Arad found the original location to the destination point of a path.
Requirements:
Using file storage map and the heuristic function table, nodes comparison algorithm efficiency in problem solving, and gave results list.
To Search:
File list (Check if you may need any files):
Romania_Trip\Debug\Romania_Trip.exe
............\Romania_Trip\Debug\Graph.obj
............\............\.....\Queue.obj
............\............\.....\Romania_Trip.Build.CppClean.log
............\............\.....\Romania_Trip.log
............\............\.....\Romania_Trip.obj
............\............\.....\.............tlog\CL.read.1.tlog
............\............\.....\.................\CL.write.1.tlog
............\............\.....\.................\link.read.1.tlog
............\............\.....\.................\link.write.1.tlog
............\............\.....\.................\Romania_Trip.lastbuildstate
............\............\.....\Source.obj
............\............\.....\Stack.obj
............\............\.....\vc120.idb
............\............\.....\vc120.pdb
............\............\Graph.cpp
............\............\Graph.h
............\............\Queue.cpp
............\............\Queue.h
............\............\Romania_Trip.cpp
............\............\Romania_Trip.h
............\............\Romania_Trip.vcxproj
............\............\Romania_Trip.vcxproj.filters
............\............\Source.cpp
............\............\Stack.cpp
............\............\Stack.h
............\............\启发式数值.txt
............\............\地图数据表.txt
............\Romania_Trip.sln
............\Romania_Trip.v12.suo
............\............\Debug\Romania_Trip.tlog
............\............\Debug
............\Debug
............\Romania_Trip
Romania_Trip
Download