搜索资源列表
BFS_DFS_an2042411142007
- Algorithm BFS and DFS
main
- This the basic algorithm for BFS and DFS-This is the basic algorithm for BFS and DFS
kurajss
- This the basic algorithm for DFS and BFS-This is the basic algorithm for DFS and BFS
bfs
- a program which performs breadth first search
BFS
- 宽度优先搜索，1215. 脱离地牢，改编一下。年轻的王子Paris与美丽的公主Helen被困在地牢里，他们想知道能否找到对方。-Breadth-first search, 1215 from the dungeon, adapted it. The young prince and the beautiful princess Helen Paris trapped in a dungeon, they want to know we can find each other.
8puzzle-49726044
- DFS&BFS for 8puzzl實作 內容有兩個檔案DFS & BFS for 8puzzl implement the contents of two files-DFS & BFS for 8puzzl implement the contents of two files
poj3945
- poj 3945 bfs,状态转化 On a small planet named Bandai, a landing party of the starship Tadamigawa discovered colorful cubes traveling on flat areas of the planet surface, which the landing party named beds. A cube appears at a certain position on a be
bessie_come_home
- USACO中的bessie come home,用C++编写，用了BFS的知识-bessie come home of USACO, with C++ prepared ，with the knowledge of the BFS
Project_BFS
- 任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中 工程名：Project_BFS 要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点 -Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFS
POJ_3131
- POJ 3131 双向BFS解立体八数码问题-POJ 3131 bi-dimensional eight digital BFS Solutions
TSP
- 使用邻接表记录存贮村庄两点的ID和村庄之间的权值。采用广度搜索，利用邓俊辉老师的模板BFS。先任取一点，搜索到它的距离最远的点（带权值）i，点i必然是关键路径上的一个最远点。再以该点为起始点搜索离他距离最远的点（带权值），所得到的一定是donfood即最远路径。-Using adjacency table records the ID stored villages and villages between the two weights. Using breadth search, use D
pacmansearch
- Pacman from UC Berkeley-Pacman hw from CS188 in UCberkeley. Give better understanding in BFS, DFS, UCS and A* search.
multiagent
- 实现了一个吃豆人小游戏的功能，使用了多种搜索算法，包括DFS以及BFS等-Implements a Pac-Man game features, using a variety of search algorithms, including DFS and BFS, etc.
Peg-solitaire-CppBFS
- Peg solitaire is a classical puzzle commonly played on a 33-hole cross-shaped board (also called "the English Board") or a 15-hole triangular board. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and
P
- 规范 BFS 写法，可以有效地避免一些状态判重和状态转移上的细节错误，使用优先队列，这里不用优先队列会错。-BFS written specification, can effectively avoid the details of some of the state and the state transition heavy sentence on the error, use the priority queue, priority queues are not wrong here.
MDS_Project
- A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, de
Lopez-Valenzuela
- Un Block Me solve with heuristics and BFS search.
BFS-for-eight-digit
- 广度优先搜索实现八数码，源码和可执行文件， 未优化，带注释-Breadth-first search to achieve eight digital, source code and executable files, Unoptimized, annotated
BFS
- 迷宫问题 队列求解 界面还不完善 可以自己添加-Maze problem solving interface queue is not perfect you can add your own
bfs_mex
- bfs FGFJF KDLFLF LFLMLFMF