Location:
Search - dfs.zip
Search list
Description: 深度优先搜索算法解决八码难题-depth-first search algorithm to solve eight problems yards
Platform: |
Size: 2048 |
Author: 高兵 |
Hits:
Description: 采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes
Platform: |
Size: 11264 |
Author: 黄丽雯 |
Hits:
Description: 我的数据结构作业 是比较经典的算法 请大家参考-operating data structure is more classical algorithm please refer to
Platform: |
Size: 1024 |
Author: 王子 |
Hits:
Description: dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data structures operations
Platform: |
Size: 1024 |
Author: 笨熊 |
Hits:
Description: 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.
-Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere 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.
Platform: |
Size: 3072 |
Author: bo |
Hits:
Description: 动态提示控件，需要编译后使用，超级好用，欢迎大家下载此控件，好东西大家用-Dynamic prompt control, the need for the compiler to use, super easy to use, welcome everyone to download this control, good things with everyone
Platform: |
Size: 612352 |
Author: fsj |
Hits:
Description: 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
Platform: |
Size: 6144 |
Author: |
Hits:
Description: 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
Platform: |
Size: 3769344 |
Author: benson |
Hits:
Description: DFS - sof for config & unlock phones & modems
Platform: |
Size: 4081664 |
Author: andrew |
Hits:
Description: 吃豆人程序，算法可编程为DFS，A*算法等。,Pac-Man program, algorithm programmable DFS, A* algorithm.
Platform: |
Size: 342016 |
Author: pengyan |
Hits: