搜索资源列表
MST_47702
- 图的深度广度遍历和最小生成树PRIM和KRUSCA-Depth breadth traversal of the graph and the minimum spanning tree PRIM and KRUSCA, ....
width-serch
- 亲爱的站长，仰慕已久，非常想加入，特奉上代码，供您查阅。代码是关于广度遍历的。-Dear webmaster, admired the long, very much like to join special offer code for your review. The code is on breadth traversal.
graph
- 以邻接表为存储结构实现无向图的深度遍历和图的广度遍历。-Adjacency list storage structure undirected depth traversal of Figure and Figure breadth traversal.
seah
- Fish图结构数据处理程序，深度遍历和广度遍历的算法处理数据关系-Fish data structure data handler, depth and breadth-traversal algorithm processing data relationships
gram
- 图的相关运算，包括图的遍历，深度遍历，广度遍历，最小联通子图寻找-FIG related operations, including graph traversal, deep traversal, breadth, traversal, minimum Unicom subgraph Search
tu
- 该程序包含了图的创建。存储方式是以邻接表的方式实现的。实现了图的深度遍历和广度遍历。-The program includes the creation of the figure. Storage in the adjacent table to achieve. The depth the traverse and breadth traversal of the graph.
Graph
- 对图的深度，广度遍历，关键路径算法，最短路径算法实现，求生成树的深度及叶子结点数-Depth, breadth traversal, critical path algorithm, the shortest path algorithm, find the depth of the spanning tree and leaf nodes
Graph-traversal
- 实现的是图的深度遍历及广度遍历。是使用队列的结构实现的。-Achieve the traversal depth and breadth traversal of the graph.
chat
- 实现了图类的定义，并且实现了深度遍历，广度遍历，以及用dijstra算法求最短路径-Achieve the plan class definition, and the realization of the depth traversal, breadth traversal, and the shortest path algorithm with dijstra
zhang_teacher
- 九方块找路径问题，采用广度遍历，找寻回到原来位置的路径，如果遍历超过六层，则说明找不到，否则，输出其路径。-Nine squares to find path problem, USES the breadth traversal, looking back to the path of the original position, if more than six layer traversal, then find, otherwise, the output path.
Graphs
- 关于图的一些基本操作：创建、深度遍历、广度遍历、Prim算法、等等。-Some basic operations on graphs: Create, traverse the depth, breadth traversal, Prim algorithm, and so on.
12123450
- 输入图的顶点和边的信息建立图，并对其进行深度和广度遍历，输出遍历结果。-Input graph vertices and edges of the information to establish the figure, and its depth and breadth traversal, traverse the output results.
DirectedGraph1
- 数据结构->算法->有向图遍历(深度遍历、广度遍历)-Data Structures-> Algorithm-> directed graph traversal (depth traversal, breadth traversal)
5exp1
- 数据结构 c++邻接表构图 深度遍历和广度遍历-C++ adjacency list data structure traversal depth and breadth traversal
Adjacency-matrix-traversal
- 邻接矩阵遍历，可以实现邻接矩阵的深度和广度遍历-Traverse the adjacency matrix, adjacency matrix can achieve the depth and breadth traversal
deep_and_wide
- 图的深度和广度遍历代码，比较基础，适合初学者-Depth and breadth traversal code, more basic, for beginners
establishment-and-traversal
- 数据结构图的建立与遍历，广度遍历，深度遍历-Data structure of the establishment and traversal, traverse the breadth and depth traversal
Graph-traversal1
- 图的遍历，深度和广度遍历，有详细的代码和截图文件工参考-Graph traversal
ExamCpp--
- 单链表，单循环链表，双链表，循环双链表的实现，二叉树的遍历与实现。森林与树的转换以及图的深度广度遍历，邻接矩阵邻接表实现-Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of
AdjMWGraph8
- C++ 图的邻接矩阵实现及深度广度遍历 -The adjacency matrix of a graph C++ implementation and the depth and breadth traversal