Location:
Search - 生成树
Search list
Description: 模拟退火生成树，一种比较好分类方法。程序简单，易懂。-simulated annealing Spanning Tree, a better classification. Simple and straightforward.
Platform: |
Size: 2561 |
Author: ge |
Hits:
Description: 一个最小生成树,包括prim算法,可以生成一个最小生成树-a minimum spanning tree, including Prim algorithm can generate a minimum spanning tree
Platform: |
Size: 1307 |
Author: 张立博 |
Hits:
Description: 具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.
Platform: |
Size: 10455 |
Author: 望问套 |
Hits:
Description: 生成树协议标准
Platform: |
Size: 1208841 |
Author: gllw915 |
Hits:
Description: 图的建立，遍历，生成树。图的建立，遍历，生成树。图的建立，遍历，生成树。
Platform: |
Size: 44009 |
Author: yunjisuan |
Hits:
Description: 最小生成树.rar-minimum spanning tree. Rar
Platform: |
Size: 38912 |
Author: |
Hits:
Description: 利用c编写的最小生成树算法-prepared using the minimum spanning tree algorithm
Platform: |
Size: 1024 |
Author: 帆 |
Hits:
Description: 具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.
Platform: |
Size: 10240 |
Author: 望问套 |
Hits:
Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码，很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good.
Platform: |
Size: 7168 |
Author: 胡冰 |
Hits:
Description: 在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.
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 模拟退火生成树，一种比较好分类方法。程序简单，易懂。-simulated annealing Spanning Tree, a better classification. Simple and straightforward.
Platform: |
Size: 2048 |
Author: ge |
Hits:
Description: 2005年电力部数学建模大赛题目：
共有61个比赛项目，1050人参加比赛。请给出算法及其框图，同时给出合理的比赛项目排序表，使连续参加两项比赛的运动员人次尽可能的少；表中“＃”号位置表示运动员参加此项比赛。建立此问题的数学模型，并且合理安排比赛项目顺序，使连续参加两项比赛的运动员人次尽可能的少；程序使用了最小生成树算法。-2005 Mathematical Modeling Contest subject : a total of 61 events, 1,050 people participate in the competition. Please give algorithm and its frame, the event is a reasonable ranking table to enable participation in two consecutive games of 000 athletes as less; Table "#" locations athletes this game. This established the mathematical model, and reasonable arrangements event sequence, and allows the two consecutive games of 000 athletes as less; Procedures for the use of the minimum spanning tree algorithm.
Platform: |
Size: 36864 |
Author: 容器 |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树 数据结构的基本应用，适合初学者-with Primbetov (PRIM), the minimum spanning tree algorithm tectonic structure of the basic data applications, suitable for beginners
Platform: |
Size: 2048 |
Author: 阿水 |
Hits:
Description: 最少生成树问题，MST（最小生成树），具体功能很容易看懂的-minimum spanning tree problem, MST (minimum spanning tree), specific functions can easily understand the
Platform: |
Size: 340992 |
Author: 无名氏 |
Hits:
Description: 最小生成树问题
若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。
（1）利用克鲁斯卡尔算法求网的最小生成树。
（2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。
（3）以文本形式输出生成树中各条边以及他们的权值。
-minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.
Platform: |
Size: 1024 |
Author: wangjian |
Hits:
Description: (1)利用普里姆算法求网的最小生成树
(2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过
程中的连通分量。
(3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights
Platform: |
Size: 1024 |
Author: xinghenzhai |
Hits:
Description: 给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
Platform: |
Size: 566272 |
Author: art hong
|
Hits:
Description: 小生成树其实是最小权重生成树的简称。一个有n个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有n个结点，并且有保持图连通的最少的边。最小生成树可以用kruskal（克鲁斯卡尔）算法或Prim（普里姆）算法求出。(The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes is the minimal connected subgraph of the original graph, and contains all n nodes in the original graph, and has the least edge to keep the graph connected. The minimum spanning tree can be obtained using kruskal (kruskal) algorithm or Prim (Prim) algorithm.)
Platform: |
Size: 4096 |
Author: lina111 |
Hits:
Description: 生成树RSTP源码，可以让你清楚的看到STP源码的实现过程！
Platform: |
Size: 173786 |
Author: 100195155@qq.com |
Hits:
« 12
3
4
5
6
7
8
9
10
...
44
»