搜索资源列表
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
rrrrrrr
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
graph
- 以邻接表为存储结构实现无向图的深度遍历和图的广度遍历。-Adjacency list storage structure undirected depth traversal of Figure and Figure breadth traversal.
tu
- 分别写出用邻接矩阵和邻接表做图的存储结构，并分别实施广度优先遍历和深度优先遍历。-Write down made graph adjacency matrix and adjacency list storage structure, and implement the depth-first traversal and breadth-first traversal
Adjacency-matrix
- 分别以邻接矩阵和邻接表的存储结构建立图。 分别对图进行深度优先遍历和广度优先遍历。 求图中边的数目。 求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the numbe
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs