搜索资源列表
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
GraphTraversal
- 图的遍历，实现图的深度和广度两种便利方式，方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
C
- 图的深度优先遍历，图的广度优先遍历，及图的存储-Map depth-first traversal, breadth-first traversal of the graph, and map storage
graphtraverse
- 主要实现图形遍历功能，可选择深度或广度图形遍历。-Graphical traversal functions primarily to achieve, choose the depth or breadth of graphic traverse.
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
wq
- 校园导游系统，显示校园的所有景点，并完成所有景点的深度遍历，广度遍历及各景点详细信息的查询-Campus tour guide system, showing all the attractions on campus, and complete all the attractions of the depth of traversal, breadth of information traversing the query and the Attractions
tuzixitong
- 一个生成图的程序，并对图进行深度广度等遍历，整合的一个系统的应用-Generated map of a program, depth and breadth graph traversal, the application of a system integration
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
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
stategraphvist
- 借鉴了JHotDraw源码，开发单层状态图绘制工具， 支持三种遍历方法：CPP(中国邮递员算法)，广度优先算法，简化的广度优先算法 里面有三个后缀为draw的图形-Draws JHotDraw source code, developers monolayer state mapping tool, supports three traversal methods: CPP (Chinese postman algorithm), breadth-first algorith
Graph
- 对图的深度，广度遍历，关键路径算法，最短路径算法实现，求生成树的深度及叶子结点数-Depth, breadth traversal, critical path algorithm, the shortest path algorithm, find the depth of the spanning tree and leaf nodes
BFSPDFS
- 广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 -Breadth-first search and depth-first search in the network topology is realized. Bre
GraphTraversal
- 图的遍历，实现图的深度和广度两种便利方式，方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
graphtraverse
- 主要实现图形遍历功能，可选择深度或广度图形遍历。-Graphical traversal functions primarily to achieve, choose the depth or breadth of graphic traverse.
2008021106bianli
- 本代码主要用于建立无向图并输出 深度优化遍历图 广度优化遍历图 还可以退出本系统。-The code is mainly used for the establishment of an undirected graph optimization traversal Figure breadth optimization traverse the map can also exit the system and output depth.
polygon
- 在VC++6.0中，设计种子填充算法演示软件，分别演示递归算法、用栈实现非递归【深度遍历】、用队列实现非递归【广度遍历】，绘制简单的多边形-In vc++ 6.0, presentation software design seed filling algorithm, illustrate each recursive algorithm, using stack to realize non-recursive traversal 】 【 depth, with a queue to rea