亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

您現在的位置是:蟲蟲下載站 > 資源下載 > 人工智能/神經網絡 > Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

資 源 簡 介

Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

相 關 資 源

主站蜘蛛池模板: 增城市| 富宁县| 民乐县| 建湖县| 奉新县| 揭阳市| 沂南县| 开阳县| 南涧| 沂水县| 夏邑县| 卫辉市| 云龙县| 丹寨县| 凤庆县| 汤原县| 东城区| 天等县| 郧西县| 治多县| 古蔺县| 定远县| 元谋县| 北辰区| 吴忠市| 太康县| 枣阳市| 蒙山县| 化州市| 建阳市| 贡觉县| 江陵县| 锦州市| 南岸区| 绍兴市| 盐源县| 内黄县| 南岸区| 合阳县| 鹤峰县| 博罗县|