搜索资源列表
zuixiaoshengchenshu
- 用c语言编写的实现用邻接矩阵存储,最小生成树普里姆算法,最小生成树克鲁斯卡尔算法
333
- 利用图论的知识实现了最小生成树的算法，包括创建图，然后遍历图的每个节点输出生成树的节点-Knowledge of graph theory to achieve the minimum spanning tree algorithms, including the creation of maps, and then traverse the graph spanning tree output nodes for each node
kruscal_Primspanningtree
- 最小生成树两种经典算法,kruscal和Prim算法-spanning tree
prim
- 假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复执行下列操作： 在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
prim
- C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
zuixiaoshengchengshu
- 最小生成树算法,有n个城市可以用（n-1）条路将它们连通，求最小总路程的和。最小生成树算法，如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum span