搜索资源列表
DFSandBFS
- 图的搜索算法——包含深度优先搜索和广度优先搜索
main-7
- 利用深度优先搜索算法和广度优先搜索算法解决图论中最短路问题
Poj_1011_sticks
- 由题意知道，本题就是根据题目给出的木棒，拼出长度最短的等长的棒子，本题主要应用了深度优先搜索+强剪枝。我们知道，肯定是先把小棒排序，从最大的开始枚举，然后如果到某一个长度时，满足条件，哪么就输出该长度。-George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the origi
bfsaadfs
- 深度优先搜索和广度优先搜索的简单练习题源代码参考-Depth-first search and breadth-first search of simple exercises source code reference
sokudu
- C++编写的解数独小工具，深度优先搜索算法。使用时输入0代表空格，其它为原数字，输入完成后即可在0.1秒之内看到计算结果~-Sudoku gadget C++ prepared, depth first search algorithm. When using 0 representative input space, the other for the original digital input, completed in 0.1 seconds to see the results.
eightqueen
- 经典问题 8皇后,使用深度优先搜索算法。-8 Queen classic problem, using a depth-first search algorithm.
Eight
- 可以计算九宫格的走法。使用了深度优先搜索、宽度优先搜索和A算法这三种算法。-It can calculate the squares of the law. Using a depth first search, breadth first search and the A algorithm for these three.
Program1
- 实现广度优先搜索 深度优先搜索 以及 A星算法(Breadth first search, depth first search, and A star algorithm.)