搜索资源列表
liantong
- 输入图,找出该图的所有连通支。图用“邻接矩阵”法表示。用两个数组来存储图:一个数组(一维)存储图中顶点集;另一个数组(二维)映象图中顶点间的关系集。且对于无向图而言,其邻接矩阵是对称的。-Input map, to find the map of all the connected extension. Chart with
graph
- 图的各种存储结构,特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础,要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
spanningtree
- 求解最小生成树问题,输入邻接矩阵权值,可以得到结果,使用于数据结构、图论和运筹学.-Solve the minimum spanning tree problem, enter the weight adjacency matrix, can be the result of the use of data structures, graph theory and operations research.
PShortP
- 程序首先利用include的手段将文件graph0.cpp包含进来,在main()函数调用由图的邻接矩阵建立图creatgraph与取顶点i的值gervalue(const int i)的函数。随后调用pshorpath(adjmatrix &G,int v0,int dist[],int path[])函数,该函数就是狄克斯特拉算法对应的函数。-Procedures include the means of the first to use the file that contains gra
5
- 无向带权图的建立,建立其邻接矩阵并实现其广度遍历-Undirected weighted graph of the establishment, the establishment of its adjacency matrix and to achieve its breadth traversal
traffic
- 通过对图的应用,建立一套交通网络图,实现对求单源最短路径,任意两个城市间的最短路径的查询. 首先根据邻接矩阵和图的知识建立交通网络图,顶点信息存储城市道路信息,由图的最短路径查询城市间的最短道路,输出到达路径。 -Through the diagram, the establishment of a transportation network map, to achieve for single-source shortest path between any two cities i
graph_
- //有向图:有向图,无向图基本操作 //运行环境:VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径(Dijkstra,Floyd两种算法)-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
f.doc
- 题目1:图的建立与遍历;连通网的最小生成树生成实现。 内容: 1) 用邻接表表示方法建立图1所示图的存储结构,用邻接矩阵存表示方法建立图2所示网的存储结构。 2) 在图1 存储结构(邻接表)上实现深度优先搜索遍历和广度优先搜索遍历,并给出遍历结果(序列)。 3) 按照普里姆算法,在图2所示连通网的存储结构(邻接矩阵)上实现此网的最小生成树,并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
juzheng
- 图的邻接矩阵存储(数组表示)、简单输出。-Graph adjacency matrix storage (array, said), a simple output.
traffic
- 利用邻接矩阵构造一张欧洲交通图,并求出某一城市到其余城市的最少票价路径或者最短里程路径,并打印输出。 程序执行的命令包括: (1)初始化交通网络图并根据文件构造欧洲交通图;(2)用户先后输入“最优方式”和“始末城市名称”;(3)程序执行相关操作,打印出用户所需的信息;(4)结束。 -Adjacency matrix structure the use of a European transport plans, and obtained a city to the rest of t
get_assortative_coefficient
- 通过网络的邻接矩阵,获取同配系数。同配系数是复杂网络中一个重要参数。-Through the network adjacency matrix to obtain the same allocation factor. With the distribution coefficient is a complex network, an important parameter.
tudebianli
- 图的遍历和生成树求解实现(邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现) -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
TU
- 图的基本操作,包括查找,遍历,删除,邻接表和邻接矩阵的转换-Fig basic operations, including search, traversal, delete, adjacency list and adjacency matrix conversion
Adjacencylisttraversal
- 遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.
topsorting
- 此函数功能是图的遍历算法,用邻接矩阵存储图,然后求出其拓扑排序,再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information
get_shortest_paths
- 通过定义邻接矩阵,计算节点之间的最短路径长度-By defining the adjacency matrix to calculate the shortest path between node length
ds_3
- 有向无环图的拓扑排序 用邻接矩阵保存图,边的输入采用三元组(求最短路径)和二元组(拓扑排序)。-DAG topological sort of the adjacency matrix with the preservation plan, while the use of triple input (for the shortest path) and the dual group (topological sort).
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图,用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
disanti
- (1)自选存储结构,输入含n个顶点(用字符表示顶点名称)和e条边的图G; (2)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS(深度优先)顶点序列(提示:使用栈实现DFS); (3)指定任意顶点x为初始顶点,对图G作BFS(广度遍历),输出BFS顶点序列(提示:使用队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及与之相关连的边,并作DFS遍历(执行操作3);否则输出信息“不存在x”; (6)判断图G是否是连通图,输出信息“YES”/“NO
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码,图的存储形式为邻接矩阵,里面有图的邻接矩阵存储的代码,有深度优先遍历的算法,还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver