搜索资源列表
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
tutrav
- 此程序用来求图的遍历问题……题中采用的是图的邻接矩阵存储-the procedure used to plan for the traversal issue ... that is used in the adjacency matrix storage
Traverse
- 实现图的遍历，是数据结构的课程设计，觉得还不错就上传大家共享咯-map to achieve the traversal of the data structure of the curriculum design, feel pretty good on uploads share 1,10
bianldeyouyngi
- 进行图的遍历的演示,（c 语言 数据结构课程设计题）,绝对有用,可以运行-plans for the traversal of the display, (c language curriculum design data structures that), absolutely useful, can run
tubianli
- 图的遍历的演示（c 语言 数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i&
tdbl
- 图的遍历算法，包括深度优先遍历和广度优先遍历，适合初学者使用-Graph traversal algorithms, including depth-first traversal and breadth-first traversal is suitable for beginners to use
bianli
- 主要用于图的遍历程序中有两种一个是深度优先搜索一个是广度优先搜索-Mainly used for graph traversal process, there are two one is a depth-first search is breadth-first search
4
- 图的遍历:深度.广度递归遍历 (用邻接矩阵定义图) -Graph Traversal: Depth. Breadth recursive traversal (with the definition of adjacency matrix map)
1
- 图的遍历 * // 生成，深度、广度优先遍历 * 图的遍历 * // 生成，深度、广度优先遍历 * -Graph traversal*// generated, depth, breadth-first graph traversal traversal**// generated, depth, breadth-first traversal*
tudeBianli
- 图的遍历算法的演示，数据结构的课程设计，演示具体的具体操作，有文档资料-Graph traversal algorithm demo, data structure of curriculum design, presentation of specific concrete operation, have documentation
tsdbl
- 对于一个给定的任意边数和顶点值的有向图或无向图，用邻接表存储,并用深度优先搜索算法实现对图的遍历。 -For a given arbitrary value of edges and vertices of the directed graph or undirected graph, with adjacency table storage, and depth-first search algorithm for graph t
tgdbl
- 对于一个给定的任意边数和顶点值的有向图或无向图，用邻接表存储,并用广度优先搜索算法实现对图的遍历,借助队列实现。 -For a given arbitrary value of edges and vertices of the directed graph or undirected graph, with adjacency table storage, and realize the breadth-first search
tudeshixian
- 数据结构课程设计用C++实现图的遍历等！-Data structure course design using C++ Achieve graph traversal, etc.!
tu-table-DFS
- 本程序采用深度优先的方法完成图的遍历，包括连通图和非连通图。-This procedure used the method of depth-first traversal of the complete diagram, including the connected graph and non-connected graph.
graph
- 实现一个图的遍历，手动生成网络，可计算节点的度。可进行深度和广度优先遍历。-The realization of a graph traversal, manual generation of networks, nodes computable degrees. May be the depth and breadth-first traversal.
GraphFunc
- 数据结构中有关图的算法，如图的遍历，拓扑排序等·！-Data structure relating to graph algorithms, in Figure Ergodic, topological sort, etc.!
bianli
- 图的遍历，深度优先，广度优先算法，并带有邻接矩阵-Graph traversal, depth-first, breadth-first algorithm, with adjacency matrix
Graph
- c语言些的程序，数据结构中图的遍历算法实现。-c language of some of the procedures, the data structure in graph traversal algorithm.
datastruct
- 包含图的遍历和线性链表两个内容，压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report