搜索资源列表
Kruscal
- 另一种有效的Kruscal算法,可以算20个点的情形-another effective Kruscal algorithm, can count 20 points of the case
kruskal
- kruscal求最小生成树-kruscal for minimum spanning tree
MST_without input
- kruscal的源代码,实现最小生成树的算法,这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.
DSFGraph并用kruscal算法求最小生成树
- 深度优先遍历图并用kruscal算法求最小生成树
KRUSCAL
- Kruscal算法实现产生最小生成树,适用学习二叉树的朋友-Kruscal have a minimum spanning tree algorithm, the application of learning tree friends
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
kruscal
- 最小生成树,我自己做的小程序,很好用,希望和大家分享-Minimum spanning tree, my own little program, very good, and would like to share with
spanning_tree
- 最小生成树的Prim 和Kruscal算法-Prim minimum spanning tree algorithm and Kruscal
Graph-traversal-spanning-tree
- 1.显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2.当用户选择的功能错误时,系统会输出相应的提示。 3.通过图操作的实现,把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
DSFGraphaprim-MST
- 深度优先遍历图,并用kruscal算法求最小生成树-Depth-first traversal map, and for the Minimum Spanning Tree with kruscal
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
Kruscal
- 快排并查集Kruscal算法+源码 txt 快排并查集Kruscal算法+源码 txt-Row and fast algorithm+ source code search set Kruscal txt row and check the set Kruscal fast algorithm+ source code txt
liu
- 深度优先遍历 广度优先遍历 最小生成树PRIM算法 最小生成树KRUSCAL算法 -Breadth-first traversal depth-first traversal algorithm for minimum spanning tree minimum spanning tree KRUSCAL PRIM algorithm
scj_Graph
- 数据结构中有关图的创建,存储显示,深度,广度优先遍历算法,以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
test10
- (1) 掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。 (2) 掌握图的两种不同遍历方法的基本思想并能编程实现。 (3) 掌握构造最小生成树的两种算法,即Prim 算法和Kruscal算法的思想,并能编程实现。 (4) 能够灵活运用图的相关算法解决相应的实际问题。 -(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different st
data-structure-Graph
- 本软件围绕无向图的应用这一主题,用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树(分别利用Prim算法和Kruscal算法)、查找最短路径等功能。 具体功能: 给定一个图,完成: (1) 建立并显示出它的邻接链表 (2) 分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树,随时显示其构造的过程 (3) 给出某一确定顶点到所有其他顶点的最短路径 (4) 给出每一对顶点之间的最短路径 说明:程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明
prgs
- simple programs for kruscal and dijikstras algorithm
Graph
- 数据结构图的各种应用操作,Prim Dijkstra Floyd TopoSort Kruscal-various applications of operation of figure
graph
- 几乎包含了图的所有操作,邻接矩阵,邻接表建立,递归非递归深搜广艘遍历,floyd,prim,kruscal,地界斯特拉算法,拓扑排序,关键路径-Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary
map
- 数据结构 BFS DFS Prim kruscal dijkstra 代码-code of BFS DFS Prim kruscal dijkstra