搜索资源列表
DataStructure8
- Java数据结构第七课：图的实现。包括初始化图，添加边，删除边，及深度优先遍历和广度优先遍历算法。-Java Data Structure Lesson: Figure of the implementation. Including the initialization graph, add edge, remove edge, and depth-first traversal and breadth-first traversal algorithm.
Graph-DFS_WFS
- 深度优先遍历，宽度优先遍历. 程序从图文本中读取图的矩阵。 矩阵包括有向图或无向图-DFS and WFS for a graph
DFS
- 有向图或者无向图的深度优先遍历，给出遍历的节点序列-DFS for the directed or undirected graph ,which returns the ordered vertex set
SourceSeek
- 深度优先遍历图结构，得到图的路径，可用于追踪-Depth-first traversal of the graph structure map path, can be used to track
dujunnan_ddp_puzzle
- 九方块路径问题，采用深度优先的遍历方法对六层以下的深度进行遍历，如果路径深度小于6层，则输出其路径，如果大于六层，则说明。-Nine squares path problem, using the depth-first traversal method to traverse the depth under 6 layer, if the path is less than 6 layer depth, the output of its path, if more than six floo