当前位置：
首页 资源下载
搜索资源 - minimum spanning tree
搜索资源列表
-
0下载：
一般都是求图的最小生成树，本程序是带权图的最大生成树（搜索树）的算法实现，-plans are generally seeking the minimum spanning tree, the procedure is the right plan with the largest spanning tree (search tree) algorithm.
-
-
0下载：
用matalb程序来实现求一个连通图的最小生成树-matalb procedures used to achieve a graph for the minimum spanning tree
-
-
0下载：
最小生成树算法程序，已经通过编译的程序，能运行出结果-minimum spanning tree algorithm, compiled by the procedure, the results can run
-
-
0下载：
这是数据结构课老师布置的上机作业，最小生成树源码-This is the data structure layout of the course teachers on the plane operations, the minimum spanning tree FOSS
-
-
0下载：
最小生成树源码，按照所提供参数即可返回结果-minimum spanning tree, in accordance with parameters provided by the results can be returned to the
-
-
0下载：
演示了最小生成树的普林算法和克鲁斯卡尔算法得算法过程。-demonstration of the minimum spanning tree algorithm and Chapline Kelushikaer algorithm algorithm in the process.
-
-
0下载：
最小生成树算法.
包括克卢斯卡尔和普里姆算法-minimum spanning tree algorithm. Including Keleishikaer algorithm and Primbetov
-
-
0下载：
Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of m
-
-
0下载：
对于个顶点的连通网可以建立许多不同的生成树，每一棵生成树都可以是一个通信网。现在，我们要选择总的耗费最小的那棵树，这就是我们说的最小生成树。本次课程设计就是设计这样的生成树，-for network connectivity can be established in many different spanning tree, every one spanning tree can be a communications network. Now, we have to choose the l
-
-
0下载：
普里姆算法构造最小生成树，无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
-
-
0下载：
一个根据给定的图，计算出最小生成树的程序-according to a set plan, the calculated minimum spanning tree procedures
-
-
0下载：
一个生成最小树的算法，应用在VLSI中-generate a minimum spanning tree algorithm used in VLSI
-
-
0下载：
一个求最小生成树的acm题-a minimum spanning tree for the title acm
-
-
0下载：
数据结构最小生成树的求法——算法 数据结构可后实习题目-minimum spanning tree data structure for the law -- algorithm data structure can be subject after practice
-
-
0下载：
包括无向图的深度优先搜索，普里姆算法构造最小生成树，数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
-
-
0下载：
题目：若要在n个城市之间建立通信网络，只需要假设n－1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。-topics : n if the city between communication networks, need only assume that n-1 line can be. How the lowest economic cost of building the communications network, the network is a minim
-
-
0下载：
数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your reference! !
-
-
0下载：
图的建立、遍历、最小生成树、最短路径
图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path
-
-
0下载：
这是一个求最短路和最小生成树的C++的原代码,经过调试可以在机子上使用.-This is the most short-circuit for a minimum spanning tree and the original C code, after testing the use of loom.
-
-
0下载：
数据结构课程设计！MFC做的！
其中有个是链表（单链表，双向
链表图形化演示），另一个是
图的最小生成树的图形化演示）。-data structure course design! MFC done! Which is a linked list (single linked list, and two-way linked list graphic demonstration), Another is the minimum spanning tree graphic demons
-
