说明：  分别采用宽度优先、深度优先、贪婪算法和A*算法求解“罗马尼亚度假问题”，即找到从初始地点Arad到目的地点Bucharest的一条路径。 要求： 1.比较算法性能； 2.图形化界面包含：地图、算法选择、耗散值、生成节点数统计、运行时间、路径搜索动态示意图等。
(The width first, depth first, greedy algorithm and a * algorithm are used to solve the "Romanian vacation problem", that is to find a path from Arad to Bucharest. requirement: 1. Compare the performance of the algorithms; 2. Graphical interface includes: map, algorithm selection, dissipation value, statistics of generated nodes, running time, dynamic sketch map of path search, etc.)