Search - zuixiaoshengchengshu

Search - zuixiaoshengchengshu - List

[Other resource] zuixiaoshengchengshu DL : 0: 最小生成树问题若要在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.
Update : 2008-10-13 Size : 1.62kb Publisher : wangjian
[Other resource] zuixiaoshengchengshu DL : 0: 演示Kruskal算法和Prim算法集合的并,元素查找的操作及应用说明: 代码均在vc++6.0环境下编译均通过在非VC++6.0环境下编译请去掉头文件 windows.h 和函数 end()
Update : 2008-10-13 Size : 1.6kb Publisher : 毕小凯
[Other resource] zuixiaoshengchengshu DL : 1: 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法
Update : 2008-10-13 Size : 1.36kb Publisher : dialy
[CSharp] zuixiaoshengchengshu DL : 0: 最小生成树，分克鲁斯卡尔和Prim两种方法，离散数学程序之一。
Update : 2008-10-13 Size : 2.09kb Publisher : 雪睿
[Other] zuixiaoshengchengshu DL : 0: 本程序是一个对最小生成书问题的演示程序，其详细的演示了全过程
Update : 2008-10-13 Size : 1.08kb Publisher : liqipeng
[Other] zuixiaoshengchengshu DL : 0: 求最小生成树，实现Prim算法数据结构初学者可以参考
Update : 2008-10-13 Size : 896.72kb Publisher : orochi
[Data structs] zuixiaoshengchengshu DL : 0: 最小生成树问题若要在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.
Update : 2025-02-17 Size : 1kb Publisher : wangjian
[Data structs] zuixiaoshengchengshu DL : 0: 演示Kruskal算法和Prim算法集合的并,元素查找的操作及应用说明: 代码均在vc++6.0环境下编译均通过在非VC++6.0环境下编译请去掉头文件 windows.h 和函数 end() -Demo Kruskal algorithm and Prim algorithm and collection, elements of the search operation and application notes: code in vc++ 6.0 compiler environment through in non-VC++ 6.0 compiler environment please go to the U-turn paper windows.h and function end ()
Update : 2025-02-17 Size : 1kb Publisher : 毕小凯
[Data structs] zuixiaoshengchengshu DL : 0: 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法-, Respectively, using prim algorithm and Kruskal Algorithm for Minimum Spanning Tree, Minimum Spanning Tree feels when learning挺多have problems, here is an algorithm with PRIM and KRUSKAL make a minimum spanning tree algorithm
Update : 2025-02-17 Size : 1kb Publisher : dialy
[CSharp] zuixiaoshengchengshu DL : 0: 最小生成树，分克鲁斯卡尔和Prim两种方法，离散数学程序之一。-Minimum Spanning Tree, Kruskal and Prim points two ways, one of discrete mathematics procedures.
Update : 2025-02-17 Size : 2kb Publisher : 雪睿
[Other] zuixiaoshengchengshu DL : 0: 本程序是一个对最小生成书问题的演示程序，其详细的演示了全过程-This procedure is a book for the smallest problem to generate demo program, and its detailed presentation of the entire process
Update : 2025-02-17 Size : 1kb Publisher : liqipeng
[Other] zuixiaoshengchengshu DL : 0: 求最小生成树，实现Prim算法数据结构初学者可以参考-For minimum spanning tree, Prim algorithm realize beginners can refer to data structures
Update : 2025-02-17 Size : 2.89mb Publisher : orochi
[Data structs] zuixiaoshengchengshu DL : 0: 使用贪心算法编程，求解最小生成树问题,并给出详细的过程！-The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!
Update : 2025-02-17 Size : 11kb Publisher : chenchen
[Other] zuixiaoshengchengshu DL : 0: 数据结构最小生成树源代码。希望对大家有用。谢谢！-Minimum spanning tree data structure source code. Hope useful for all of us. Thanks!
Update : 2025-02-17 Size : 1kb Publisher : yaobusi
[Data structs] zuixiaoshengchengshu DL : 0: 这是一个关于数据结构中最小生成树的源代码，是课程作业。-This is data about the structure of a minimum spanning tree of the source code, programs are operating.
Update : 2025-02-17 Size : 221kb Publisher : catsic
[CSharp] zuixiaoshengchengshu DL : 0: 1．掌握最小生成树的基本概念。 2．掌握求最小生成树的方法。创建一个邻接表用来存放带权图。 -1. Grasp the basic concept of minimum spanning tree. 2. To master the methods for minimum spanning tree. Create an adjacent table used to store with the right plan.
Update : 2025-02-17 Size : 18kb Publisher : bartok
[Data structs] zuixiaoshengchengshu DL : 0: 1．利用克鲁斯卡尔算法求网的最小生成树 2.以存储边（带权）的数组表示图-1. Kruskal algorithm using minimum spanning tree for network 2. To store edge (with the right of) the array that map
Update : 2025-02-17 Size : 258kb Publisher : feixue_12
[VC/MFC] zuixiaoshengchengshu DL : 0: 这是一个数据结构c语言的最小生成树的程序代码。用的是普里姆算法实现的-This is a data structure of the minimum spanning tree c language program code. Prim algorithm is used to achieve the
Update : 2025-02-17 Size : 1kb Publisher : 杨晓华
[Windows Develop] zuixiaoshengchengshu DL : 0: 最小生成树问题--用克鲁斯卡尔算法的实现 -Minimum spanning tree problem- using Kruskal Algorithm
Update : 2025-02-17 Size : 1kb Publisher : changjian
[Data structs] zuixiaoshengchengshu DL : 0: Prim算法构造最小生成树 -Prim算法构造最小生成树
Update : 2025-02-17 Size : 5kb Publisher : china

« 12 »