分别用宽度优先、深度优先、贪婪算法和A*算法求解“罗马利亚度假问题”

[{"title":"（ 34 个子文件 723KB ） 分别用宽度优先、深度优先、贪婪算法和A*算法求解“罗马利亚度假问题”","children":[{"title":"Romania_Trip","children":[{"title":"Romania_Trip.sln <span style='color:#111;'> 982B </span>","children":null,"spread":false},{"title":"Romania_Trip.v12.suo <span style='color:#111;'> 58.50KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Romania_Trip.pdb <span style='color:#111;'> 1.49MB </span>","children":null,"spread":false},{"title":"Romania_Trip.ilk <span style='color:#111;'> 1.70MB </span>","children":null,"spread":false},{"title":"Romania_Trip.exe <span style='color:#111;'> 127.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"Romania_Trip","children":[{"title":"Romania_Trip.vcxproj.filters <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"Graph.h <span style='color:#111;'> 846B </span>","children":null,"spread":false},{"title":"Stack.cpp <span style='color:#111;'> 1.07KB </span>","children":null,"spread":false},{"title":"地图数据表.txt <span style='color:#111;'> 3.48KB </span>","children":null,"spread":false},{"title":"Source.cpp <span style='color:#111;'> 1.82KB </span>","children":null,"spread":false},{"title":"Romania_Trip.cpp <span style='color:#111;'> 4.69KB </span>","children":null,"spread":false},{"title":"Romania_Trip.h <span style='color:#111;'> 656B </span>","children":null,"spread":false},{"title":"Queue.cpp <span style='color:#111;'> 2.68KB </span>","children":null,"spread":false},{"title":"Queue.h <span style='color:#111;'> 491B </span>","children":null,"spread":false},{"title":"Stack.h <span style='color:#111;'> 393B </span>","children":null,"spread":false},{"title":"Graph.cpp <span style='color:#111;'> 7.20KB </span>","children":null,"spread":false},{"title":"Romania_Trip.vcxproj <span style='color:#111;'> 4.48KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"Romania_Trip.Build.CppClean.log <span style='color:#111;'> 1.70KB </span>","children":null,"spread":false},{"title":"vc120.pdb <span style='color:#111;'> 412.00KB </span>","children":null,"spread":false},{"title":"Stack.obj <span style='color:#111;'> 151.83KB </span>","children":null,"spread":false},{"title":"Source.obj <span style='color:#111;'> 155.86KB </span>","children":null,"spread":false},{"title":"Romania_Trip.log <span style='color:#111;'> 1.93KB </span>","children":null,"spread":false},{"title":"Romania_Trip.obj <span style='color:#111;'> 283.11KB </span>","children":null,"spread":false},{"title":"Queue.obj <span style='color:#111;'> 153.02KB </span>","children":null,"spread":false},{"title":"Graph.obj <span style='color:#111;'> 259.71KB </span>","children":null,"spread":false},{"title":"vc120.idb <span style='color:#111;'> 395.00KB </span>","children":null,"spread":false},{"title":"Romania_Trip.tlog","children":[{"title":"CL.write.1.tlog <span style='color:#111;'> 7.50KB </span>","children":null,"spread":false},{"title":"CL.read.1.tlog <span style='color:#111;'> 61.38KB </span>","children":null,"spread":false},{"title":"cl.command.1.tlog <span style='color:#111;'> 3.92KB </span>","children":null,"spread":false},{"title":"link.write.1.tlog <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"link.command.1.tlog <span style='color:#111;'> 2.10KB </span>","children":null,"spread":false},{"title":"link.read.1.tlog <span style='color:#111;'> 3.93KB </span>","children":null,"spread":false},{"title":"Romania_Trip.lastbuildstate <span style='color:#111;'> 203B </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"启发式数值.txt <span style='color:#111;'> 249B </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]