搜索资源列表
connected-components
- 此代码是基于数据结构算法分析的代码,用到图论中的深度优先收索法来求连通分支的问题,只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the
DFStree
- 这是关于图的链接表的深度优先和广度优先搜索的完整代码,希望能给广大的数据结构初学者一点帮助。-This is on the map linked table depth-first and breadth-first search the complete code, hoping to give the majority of the data structures that can help beginners.
graph
- 1. 分别以邻接矩阵和邻接表的存储结构建立图。 2. 分别对图进行深度优先遍历和广度优先遍历。 3. 求图中边的数目。 4. 求顶点0到图中其余每个顶点的最短路径。 -1, respectively, the adjacency matrix and adjacency list storage structure created map. 2, respectively, the graph depth-first traversal and breadth-fir
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
Question_Graph
- 主要是基本的图算法,包括基本的深度优先搜索和广度优先搜索-Mainly is the basic algorithm of figure, including basic depth-first search and breadth-first search
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
6.7.1
- 图的深度和广度优先搜索1.图采用邻接表的存储结构2.深度优先搜索图3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
graph_dfs
- 数据结构中的图结构的深度优先遍历算法,包括按邻接表方式存储的图。-dfs algorithm for graph structure
ALGraph
- 图的邻接表存储下的深度优先遍历,广度优先遍历,以及拓扑排序-Adjacency table storage, the depth-first traversal, breadth-first traversal, and topological sorting
graph
- 数据结构,建立图,实现图的深度和广度优先搜索,最小生成树,最短路径-Data structure, the establishment figure, to achieve the depth and breadth-first search, minimum spanning tree, shortest path
BDFSM
- 图的遍历算法,可实现对顺序存储结构的图进行深度优先搜索遍历。-Graph traversal algorithm
graph
- 图的深度递归与非递归遍历,广度优先搜索遍历。VC6.0-Figure recursive and non-recursive traversal depth, breadth-first search traversal.
BFS
- 该代码实现了基于邻接表的深度优先遍历和广度优先遍历,并包含求图的割点的算法,可以在VS2010下直接运行。-The code implement the BFS and DFS of graph based on adjacence list.It includes the algorithm that find all articulated node. It can run in the environment of VS2010.
GraphShow
- 图的遍历动态演示程序,通过鼠标操作实现对图的创建、删除和修改。有无向图和有向图,可以自动生成图。实现了图的广度优先遍历和深度优先遍历。这都是动态图形演示的,而且配合代码来执行,可以做到类似调试代码的效果来查看图的动态演示。-Dynamic graph traversal demo program, to achieve the creation of the map by mouse operation, delete, and modify. Have to map and directed
exp8.7
- 图G采用邻接表存储,编写一个实现连通图G的深度优先遍历-Figure G adjacency table is stored, prepared to achieve a depth-first traversal of a connected graph G
software-design-I
- c++实现的非常详细的数据结构与算法代码,队列,链表,三元组,哈弗曼树,树的各种递归,非递归遍历算法,树与森林相互转化算法,图的深度,广度优先搜索算法,双连通算法,强连通算法,拓扑排序算法,最短路径算法,哈希,快速排序,归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non r
chandc2
- 图的邻接表存储与深度优先遍历.设计图的邻接表存储结构,数据元素的数据部分可以是随机生成的整数;设计图的深度优先遍历算法;-a vc++ program about the store of a graph and how to go over it
Graph
- C语言建立图,图的广义优先搜索和深度优先搜索,领接表与邻接矩阵转换-Graph and Graph Application
DFS100
- 标准的深度优先搜索算法,可实现节点遍历、产生随机路由、检测图中是否有回路等功能,-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
map
- 非常经典的 图的深度和广度优先遍历,可以下载一下学习学习-The depth and breadth very classic graph traversal priority, learn what you can download