搜索资源列表
VC++ 图的遍历
- 图的遍历可视化
数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
- 数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
AOESEARCH
- 无向图的邻接表的建立和遍历-no plans to the table adjacent to the establishment and ergodic
tudebianli
- 图的遍历，搜索-traverse map, search
ds grafh
- 一个关于图的遍历的操作实现-a map of the operation to achieve the ergodicity
BiTree分割视图版
- 将视图分割成两部分，左边为显示取，右边为数据录入区，每录入一个节点数据，立即在左边显示节点图形，能实现二叉树的插入、删除、前序遍历、中序遍历、后序遍历。-View will be divided into two parts, shown from left to right for the data entry areas, each node a data entry immediately on the left shows no
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph＝( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of
xuehaiwuya
- 算法有关于树的遍历的，还有图的搜索等等的数据结构相关算法-algorithm on the traversal of the tree, and there are also search the data structure correlation algorithm
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of t
有向图从邻接矩阵转换为邻接表后的dfs
- 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU seri
graphserch
- 此个小程序是用于实现图的操作的,用邻接表的形式存图,实现遍历的函数-this small procedure is used to implement the plan to operate, with the adjacent table in the form of retention plan to achieve iterated function
tdbl
- 图的遍历 数据结构我这学期才学的 这是我们的实验啊-map data structure I traverse this semester scholarship, which is our experimental ah-huh
graphicsalgorithmy
- 一套很好的图论算法源码,包括图的遍历,最短路径的实现，有向图计算、拓扑排序等多个算法的源码。-a good graph algorithm source code, including the traverse map, the shortest path, and it is to map, many other topological sorting algorithm source code.
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的，此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入，实现图的深度优先遍历和广度优先遍历过程的演示，对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Th
graphshguang
- 图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as
up3
- 本程序为“有向图的遍历及运算”，非常方便使用，希望大家能够喜欢。-the procedures as "directed graph traversal and calculations," is very convenient to use and I hope we can like.
tu0
- 图的遍历，有广度、深度遍历。 有两种存储结构，包括领结表、领结矩阵。-graph traversal, breadth, depth traverse. There are two storage structures, including Bowtie table, tie matrix.
50402417
- 和树类似，图的遍历是图的一种主要操作，可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量，但对于带权图（网），其最小生成树或最短路径都取决于弧或边上的权值，则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between a