搜索资源列表
shensou
- 深度优先搜寻的模板，深搜可以解决很多图的问题，可以遍历图中的任意位置，从而解决问题-Depth-first search template, deep search problems can be solved a lot of plans, you can traverse the graph of an arbitrary position to solve the problem
tu
- 图的遍历 从图中某一顶点出发遍历图中其余顶点，且使每一个顶点仅被访问一次。通常有两条遍历图的路径：深度优先搜索和广度优先搜索。 -Graph traversal
1130
- 用邻接表创建图的函数,输入完毕后请用深度优先遍历的方法输出顶点序列。-Adjacent table to create a graph with a depth-first traversal function, after entering the output sequence of vertices.
exp8.7
- 图G采用邻接表存储，编写一个实现连通图G的深度优先遍历-Figure G adjacency table is stored, prepared to achieve a depth-first traversal of a connected graph G