搜索资源列表
MinTree
- 最小生成树:分别输入顶点信息、边的信息,然后输出最小生成树的各条边的信息-Minimum Spanning Tree: enter vertex information, edge information, and then the output of the minimum spanning tree edges of the information
zuixiaoshengchenshu
- 用c语言编写的实现用邻接矩阵存储,最小生成树普里姆算法,最小生成树克鲁斯卡尔算法 -With c languages using adjacency matrix storage, minimum spanning tree Primbetov algorithm, minimum spanning tree algorithm Kruskal
zuixiaoshengchengshu
- 求最小生成树,实现Prim算法 数据结构初学者可以参考-For minimum spanning tree, Prim algorithm realize beginners can refer to data structures
MST_Prim.txt
- 最小生成树,使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.
prim
- 实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径-Realize minimum spanning tree algorithm, through the PRIM algorithm. By entering a string of characters show minimal spanning tree. Find the smallest path
ee
- 数据结构课程设计,哈夫曼编码,约瑟夫环,矩阵运算,最小生成树,车站管理。-Data structure the curriculum design, Huffman encoding, Joseph Wan, matrix computation, minimum spanning tree, the station management.
multiple_tree
- 用于计算带度约束的最小生成树,可用于光网络组播。-Used to calculate the degree of constraint with the minimum spanning tree can be used in optical network multicast.
Prim
- 使用贪心算法实现PRIM最小生成树算法.经典的算法题目.-PRIM algorithm using the greedy algorithm for minimum spanning tree. Classic topics algorithm.
0
- 该程序生成一个城市网络的最小生成树,可以按需求自己设置定点数和路径-The program generates a network of cities of the minimum spanning tree can be set according to demand their own set points and path
graph
- 数据结构C对图的操作算法,有广度、深度优先遍历,拓扑排序,最短路径的实现算法,最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorith
zuixiaoshengchengshu
- 使用贪心算法编程,求解最小生成树问题,并给出详细的过程!-The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!
Prim
- 用普里姆(Prim)算法构造最小生成树,满分作业,运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong
graph_
- //有向图:有向图,无向图基本操作 //运行环境:VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径(Dijkstra,Floyd两种算法)-//Directed graph: directed graph, undirected graph basic o
Prim
- 这是一个构造最小生成树的Prim算法,是属于贪心算法的范畴。设G=(V,E)是连同带权图,V={1,2,3,...,n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V =
MSTkruskal
- 最小生成树的kruskal算法实现 使用mfc显示界面(可以随机生成边)-Kruskal minimum spanning tree algorithm using mfc display interface (can be randomly generated edge)
GZ
- 给定一个地区的n个城市间的距离网,用Prim算法或Kruskal算法建立最小生成树,并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spann
kruskal
- 最小生成树:一个单位内的10个办公点通过局域网连接,输入办公室内的连接线,输出成本最低的局域网连接-Minimum spanning tree: a flat 10 points through the office LAN connectivity, enter the office of the connecting line, the output of the lowest cost LAN connectivity
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用克鲁斯卡尔算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述:若要在n个城市之间架设通讯网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通讯网,是一个网的最小生成树问题。 设计要求:利用Prims算法求网的最小生成树;以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network
Kruskal
- Kruskal求最小生成树算法 . 详细中文注释, 易于理解!-Kruskal for minimum spanning tree algorithm. Detailed English notes, easy to understand!