搜索资源列表
Floyd
- 无向图求最短路的floyd算法通用matlab程序 -Undirected graph for the shortest path algorithm floyd General matlab program
MINTREE
- 无向图的最小生成树程序，还不错哦~供大家分享，有文字说明-Undirected graph of the minimum spanning tree procedure, but also good for your sharing ~ Oh, there are text
undirected_graph_connectivity
- 求无向图连通分支_dfs实现,很好用，希望和大家分享-For undirected graph connectivity _dfs branch to achieve
wuxiangtu3
- 无向图的深度优先搜索 无向图的深度优先搜索 无向图的深度优先搜索 -Undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph of the depth-first search
wuxiangtu4
- 无向图的宽度优先搜索 -Undirected graph in breadth-first search of undirected graph breadth-first search
4.1
- 采用图的邻接表作为图的存储结构，完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
SY11
- 邻接表存储有向图，判断任意两结点间有无路径-Storage adjacent to the map table to determine the two arbitrary whether the path between nodes
xiaoyuan
- 设计一个校园导游程序，为来访客人提供各种信息查询服务。测试数据根据实际情况指定。提示：一般情况下，校园的道路是双向通行的，可设校园平面图是一个无向图。顶点和边均含有相关信息。-Procedure to design a campus tour guide for visitors to provide information services. Test data specified according to the actual situation. Tip: In general, the
GraphDFS
- 应用深度优先遍历法访问无向图，采用了递归调用法和栈两种方法实现，很好的对比实现了算法-Use the means of DFS to visit undiction graph
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
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
Floyd
- Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm