搜索资源列表
BFSTraverse.CPP
- 深度优先遍历。包含深度优先遍历的源代码，-depth-first traversal. Depth-first traversal contains the source code,
bfstraverse
- 能够输入节点 然后完成图的广度优先遍历-Able to enter the node and then complete the graph breadth-first traversal
BFSTraverse
- 图的遍历_邻接表存储.cpp 检验深度优先和广度优先的程序(邻接表存储表示)-Graph traversal _ adjacent table storage. Cpp test the depth and breadth of the priority of priorities Procedure (adjacent table, said storage)
017
- 建立图的邻接表,输出图的邻接表,深度优先遍历,广度优先遍历-CreateGraph,OutputGraph,DFSTraverse, BFSTraverse
BFSTraverse
- 利用BFS算法和队列实现在棋盘上已知“马”的初始位置，得到其在指定步数内可以到达的所有位置的功能-Use BFS algorithm and queue on the board to achieve a known " horse" in the initial position, get the function which can be reached within a specified number of steps in all positions