搜索资源列表
tudebianli
- 数据结构与算法 图的遍历 算法
tudebianli
- 图的遍历，搜索-traverse map, search
tudeBianli
- 图的遍历算法的演示，数据结构的课程设计，演示具体的具体操作，有文档资料
tuDeBianLi
- 以邻接表为存储结构，选择图的类型（有向图或无向图），创建相应的图。对创建的图按深度优先和广度优先的遍历。（文档中含代码）
tudebianli
- 222 2分别通过深度和广度对图进行遍历-222 2, respectively, through the depth and breadth of the graph traversal
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
tudebianliywc
- 只要就是用来实现图的遍历的功能，用c++语言实现的，是比较精简的数据结构。-shixian tudebianli gongneng
tudebianli
- 图的遍历包括深度优先搜索和广度优先搜索，大家可以看看。-Graph traversal, including depth-first search and breadth-first search, we can look at.
tudebianli
- 图的遍历，查照最短路径，利用递归和迭代的算法-Graph traversal, shortest path looked at the use of recursive and iterative algorithms
tudebianli
- 能够进行图的遍历，其中包括有队列的出对入队运算。-Graph traversal can be carried out, including a queue out the right into the team operation.
tudebianli
- 图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书-yrteryryer
tudebianli
- 实现图的深度优先, 广度优先遍历算法，并输出原图结构及遍历结果。 初步完成总体设计，搭好框架； 最低要求：两种遍历都要实现，写出画图的思路； 进一步要求：画出图的结构，有兴趣的同学可以进一步改进图的效果。 -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and the traversal result. Complet
tudebianli
- 图的深度遍历和广度遍历（以邻接表为存储结构）-The depth and breadth traversal graph traversal (in the adjacent table for the storage structure)
tudebianli
- 关于图的遍历，是C语言中的难点。不懂的新人可以参考！-Traversal on the graph is C language difficulties. Newcomers can not understand the reference!
tudebianli
- 一个完整的图的遍历的基础程序，对于刚学数据结构（C++）的朋友来说很好，简明易懂！-A complete graph traversal based program, for just learning the data structure(c++)is a very good friend, easy to understand!
tudebianli
- 建立图的存储结构（图的类型可以是有向图、无向图、有向网、无向网，学生可以任选两种类型），能够输入图的顶点和边的信息，并存储到相应存储结构中，而后输出图的邻接矩阵。-Establishment of the storage structure map (map type can be a directed graph, undirected graph, directed networks, undirected networks, students may choose one of two
tudebianli
- 使用邻接表存储结构，编写一个程序，实现对有向图遍历操作。是用C++编写的程序源代码。-Storage structure using the adjacency list, write a program to achieve a directed graph traversal operations. Is a program written in C++ source code.
tudebianli
- 实现图的深度优先, 广度优先遍历算法，并输出原图结构及遍历结果。 分步实施： -To achieve the depth chart first, breadth-first traversal algorithm, and outputs the result through the structure and artwork. Step by step:
tudebianli
- 图的遍历，很不错的程序哦，可以进行图的遍历，输入@分割节点-this is a program which can achieve tu de bianli you see
tudebianli
- 数据结构图的遍历 数据结构图的遍历-Graph traversal of data structures