搜索资源列表
GraphPath
- 查找有向图、无向图的两点之间的所有路径。有使用方法。-It s method to find all path between two Node in a graph.
B
- Prim算法完整实现代码收藏 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete collection of code using Prim algorithm for undirected graph of the minimum spanning tree
graph
- 图: 调试图的邻接链表存储的程序,解决下列问题: 根据教科书P157页的G2图(无向图),输入数据运行程序;再适当修改程序使它适用于G1图(有向图),输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
071806210
- (1)、了解无向图和有向图的概念 (2)、掌握无向连通图或有向连通图的最小生成树的构造算法既Prim算法 (3)、了解有向图跟无向图的最短路径的解法 (4)、掌握图与网的基本概念和基本存储方法 -make your 111111111111
zuixiaoquandingdianfugai
- 给定一个赋权无向图G=(V,E),每个定点v∈U都有一个权值w(v)。如果U V,且对任意(u,v)∈E有u∈U或v∈U,就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。-Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on
1
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Storage without the use of the adjacent table to the map, and the depth and breadth traversal graph traversal
bai
- 用C++编写的用邻接矩阵来创建无向图,并求每个点的度。-Adjacency matrix with the creation of undirected graph, and for degrees.
poj
- pku 3613 Cow Relays 题意:给一个无向图,求从起点s到终点e尽力n条边的路径最小值。 边的数量2<=t<=100(每条边可以重复遍历) 算法:利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数,假设 i 到 k 要途径 2^l 条边,那么他可以被分为两段 途径2
5_5
- C语言 数据结构 关于 无向图的 有iguansuanfa-gdgdhghfu ufu j h dghdh d
Floyd
- Floyd 算法,创建有向图,无向图,有向网,无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
Prime
- Prime 算法,创建有向图,无向图,有向网,无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
prim
- prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的,已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.
4-creatDG
- 1、 图的存储结构的定义和图的创建 图的种类有:有向图、无向图、有向网、无向网。 图的存储结构可采用:邻接矩阵、邻接表。 要求:分别给出邻接矩阵和邻接表在某一种图上的创建算法 -1, Figure storage structure definition and diagram types to create plans are: a directed graph, undirected graph, directed networks, undirected networks.
BuildAndOutputDiagramForC
- 用C语言实现数据结构中的图的建立和输出,可实现输出有向图和无向图,由用户自己选择建立有向图还是无向图的邻接矩阵。用户输入图的定点和边的信息,存储到相应的存储结构中去,而后输出图的邻接矩阵。-Data structure using C language implementation of the map creation and output, enabling the output have to map and undirected graph, chosen by the user to
prim
- Prim算法用于求无向图的最小生成树. -Prim algorithm is used to seek an undirected graph of the minimum spanning tree
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索,按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
Algorithms
- 压缩包中包括几个常用算法对应的POJ练习题的实现,包括,无向图的欧拉回路,点的割集,TRIE树,最优比率生成树,最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, t
dijkstra
- 数据结构中非常经典和通用的算法,学习数据结构必须掌握的知识点,题目中的算法针对无向图,当然也适用于有向图,不过边的权值不能为负,否则不满足算法适用的条件-dijkstra
Dijkstra
- 用Dijkstra法求最短路径,有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre ) { int v,w,j,l=1 Status*final Status min final=(Status*)malloc( sizeof(Status)*i ) for(v=0 v<i v++) { final[v]=FA