搜索资源列表
-
0下载：
最小生成树.rar-minimum spanning tree. Rar
-
-
0下载：
最小生成树的prim算法
是求图中的最短路径的一个重要算法
但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
-
-
0下载：
在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
-
-
0下载：
包括最短路及最小生成树算法，对于参加建模很有用的-including the most short-circuit and the minimum spanning tree algorithm, for participating in modeling very useful
-
-
0下载：
本源程序为matlab文件，实现最小生成树和关键路径的查找。-the source document for Matlab and achieve minimum spanning tree and find the critical path.
-
-
1下载：
在boost基础上实现
对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree.
-
-
0下载：
最小生成树的贪心算法实现
普里姆算法
用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation
-
-
0下载：
图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
-
-
0下载：
Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!
-
-
0下载：
用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小，即求最小生成树问题。-Undirected graph with n cities that traffic between the network construction plan, the vertices represent the city, right next to that the cost of the line, try to design a pr
-
-
0下载：
基于C++的最小生成树算法编写，可以快速生成最小生成树-Write, you can quickly generate a minimum spanning tree based on the minimum spanning tree algorithm in C++
-
-
0下载：
数据结构课程设计，关于最小生成树的，希望能帮助大家，挺不错的哈。,Data structure curriculum design, minimum spanning tree, we want to help, very good.
-
-
0下载：
在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树-If there subgraph G ' contains all vertices in G, and part of the side, and does not form a loop, then G' in a few vertices connected graph G is the spanning tree of a gr
-
-
0下载：
利用VC实现的最小生成树算法，可能在VC6.0环境下正常运行-VC to achieve the minimum spanning tree algorithm may VC6.0 environment in normal operation
-
-
0下载：
最小生成树，就是给定一个无向图，挑选若干条边，连成一个树行图（无圈），使得所选边的权至和最小。运用的是Kruskal算法。-Minimum spanning tree, that is, given an undirected graph, choose several edge, into a tree line graph (no ring), making minimal rights to the selected edge
-
-
0下载：
自己用C++编写的一个简单的关于最小生成树问题的-With C++ prepared for a minimum spanning tree
-
-
0下载：
最小生成树权值计算的源代码，输入结点个数，和各结点之间用三元法表示的权值，利用算法计算最小生成树-Minimum spanning tree weight calculation of the source code, the right to use the ternary notation of the number of input values between nodes, and each node using the minimum spanning tr
-
-
0下载：
xiangx详细介绍了基于最小生成树的施泰纳树问题，还有一种方法是介绍基于最短路径的施泰纳树-xiangx detailing the minimum spanning tree based Steiner tree problem, there is a way to introduce the shortest path based Steiner tree
-
-
0下载：
Minimum Cost Spanning Tr-Minimum Cost Spanning Tree
-
-
0下载：
在visual C++环境中实现图的最小生成树的生成，并实现最小生成树的权重的计算-Heavy computing implemented in visual C++ environment, minimum spanning tree graph generation and achieve the minimum spanning tree right
-
«
1
2
3
4
56
7
8
9
10
...
42
»
