搜索资源列表
tubianliyingyong
- 图遍历应用。针对于大学数据库课程设计。不对的地方希望勾手指点-Figure traversal application. For curriculum design in the university database. Wrong with hope hook pointing
5
- 1. 掌握图的基本存储方法； 2. 掌握有关图的操作算法并用高级语言实现； 3. 熟练掌握图的两种搜索路径的遍历方法。 -1. To master plan the basic storage methods 2. Information on the plans and the operation of algorithms to achieve high-level language 3. The master plan of the traverse path of t
fgwgg
- 关于图的深度优先遍历和广度优先遍历 方便易懂 很容易入手-Depth-first traversal on the graph and the breadth-first traversal is easy to start with easy to understand
The-data-structure-of-operation
- 领会图的类型定义； 2. 熟悉图的各种存储结构及其构造算法； 3. 熟练掌握图的两种遍历算法。-Understand the type definition Figure 2. Various storage familiar graph structure and its construction algorithm master Figure two traversal algorithm.
trees
- 我自己做的无向图处理程序可生成最小生成树可遍历生成邻接矩阵邻接表-I do no generate a directed graph traversal process can generate a minimum spanning tree adjacency matrix adjacency list
2222
- 构造一个图，至少有四个结点，实现图的非递归深度优先遍历，存储、初始化也包括在内。-Construct a map, at least four nodes, to achieve non-recursive depth-first traversal, the memory, the initialization is also included.
Graph-traversal
- 图的遍历，使用C语言，实现图的前序，中序，倒序遍历-Graph traversal, using C language graph traversal
lab
- 要求建立图的邻接表存储结构，输入或存储任意一个无向图，显示图的深度优先搜索遍历路径（非递归）和广度优先搜索遍历路径。- U8981 u5E8 u5E8 u5E8 u6EF u6EF u4E00 u4E2A u65E0 u653 U56FE uFF0C u663E u793A u56FE u7684 u6DF1 u5EA6 u4F18 u5148 u641C u7D22 u904D u5386 u8DEF u5EA U5138 u641C