Description: Astart algorithm to understand the structure of the map, stack, queue, priority queue and other data structures, and through the backtracking process to solve the Romanian holiday problem. The problem is through the Astart algorithm, traverse all nodes (places), looking for the shortest path.
To Search:
File list (Check if you may need any files):
Astar_Romania
.............\Astart.c
.............\Astar_Romania.c
.............\Astar_Romania.vcxproj
.............\Astar_Romania.vcxproj.filters
.............\Debug
.............\.....\Astart.obj
.............\.....\Astart.sbr
.............\.....\Astar_Romania.Build.CppClean.log
.............\.....\Astar_Romania.log
.............\.....\astar_romania.nativecodeanalysis.xml
.............\.....\Astar_Romania.obj
.............\.....\Astar_Romania.sbr
.............\.....\Astar_Romania.tlog
.............\.....\..................\Astar_Romania.lastbuildstate
.............\.....\..................\bscmake.read.1.tlog
.............\.....\..................\BscMake.write.1.tlog
.............\.....\..................\CL.read.1.tlog
.............\.....\..................\CL.write.1.tlog
.............\.....\..................\link.read.1.tlog
.............\.....\..................\link.write.1.tlog
.............\.....\graph.nativecodeanalysis.xml
.............\.....\graph.obj
.............\.....\graph.sbr
.............\.....\NativeCodeAnalysis.read.1.tlog
.............\.....\pqueue.nativecodeanalysis.xml
.............\.....\pqueue.obj
.............\.....\pqueue.sbr
.............\.....\queue.nativecodeanalysis.xml
.............\.....\queue.obj
.............\.....\queue.sbr
.............\.....\stack.nativecodeanalysis.xml
.............\.....\stack.obj
.............\.....\stack.sbr
.............\.....\vc.nativecodeanalysis.all.xml
.............\.....\vc120.idb
.............\.....\vc120.pdb
.............\graph.c
.............\graph.h
.............\pqueue.c
.............\pqueue.h
.............\queue.c
.............\queue.h
.............\stack.c
.............\stack.h