搜索资源列表
8连通
- 计算8连通区数量 利用深度优先遍历，并对同一8连通区进行标记，当遇到不属于同一连通区且灰度符合要求的则计数加1，分别考察一个点周围的八个点。-8 COMPONENTS calculated using the number of depth-first traversal, and the same eight areas marked connectivity, when they do not belong to the same gray zone, connectivity to m
C
- 图的深度优先遍历，图的广度优先遍历，及图的存储-Map depth-first traversal, breadth-first traversal of the graph, and map storage
Depth_FirstSearth
- 实现图的深度遍历 是一个深度优先算法 基于树的先跟遍历-Realize the depth chart is a depth-first traversal algorithm is based on the tree to begin with traversal
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
123
- 图的遍历的演示，用C++编写。。。 深度广度优先遍历-tu de bianli
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
Graph
- 此程序主要是实现图的深度优先遍历和广度优先遍历。-The procedure is to achieve the figure of the depth-first traversal and breadth-first traversal.
_
- 图运算 在邻接矩阵存储结构上实现图的深度和广度优先遍历算法-Figure computing adjacency matrix storage structure diagram of the depth and breadth-first traversal algorithm
BFSPDFS
- 广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 -Breadth-first search and depth-first search in the network topology is realized. Bre