搜索资源列表
mst
- 本程序中通过变量DataSize指定了待排序序列的长度为60,顺序输出各个处理器的局部数据就可以得到全局有序的序列。
mst
- java各种题 java各种题
Mosets.MTree.2.07.PHP.NULLED.MST
- Joomla收费插件。建立商业登记,商品,广告,房地产,文件目录 Mosets Tree is the only directory component for Joomla! that allows you to run large directory website with customizable templates, user ratings, Search Engine Friendly URLs and more. Fast, Simple and Flexible.
MST717sourcecode
- MST-717C ........\Device ........\inc ........\kernal ........\msFunc ........\msLib ........\osd ........\pc ........\project ........\.......\128k ........\.......\....\cartv.lin ........\.......\....\CarTV_128.Op
Maria9 CarTV
- mstar MST702、MST703、MST705芯片最新源代码
MST
- 最小生成树算法,数据结构中的经典算法,其中含测试数据-The minimum spanning tree algorithm
MST6M68FQ
- MST6M68FQ DMB LCD数字电视处理器.pdf-mstar MST6M68FQ datasheet
prim
- 对于网络,其生成树中的边也带权,将生成树各边的权值总和称为生成树的权,并将权值最小的生成树称为最小生成树(Minimun Spanning Tree),简称为MST。 Prim算法的基本思想是: (1) 在图G=(V, E) (V表示顶点 ,E表示边)中,从集合V中任取一个顶点(例如取顶点v0)放入集合 U中,这时 U={v0},集合T(E)为空。 (2) 从v0出发寻找与U中顶点相邻(另一顶点在V中)权值最小的边的另一顶点v1,并使v1加入U。即U={v0,v1 }
NXP_UOC3_LCDTV_Code_Mstar
- MStar518 Scaler驱动源码 8052单片机控制Nxp经典TV方案UOCIII配合Scaler驱动 实现低成本成熟液晶电视方案-MStar518 Scaler driver source 8052 SCM control Nxp classic TV programs UOCIII with the drive to achieve low-cost mature Scaler LCD TV program
kruskals
- Kruskal s algorithm implementation for generating minimum spanning tree. Random network is generated. Then MST is generated using kruskals and then density gradient applied.
MST
- 实现最小生成树的算法(包括Kruskal和Prim算法) 在codeblocks下运行-Achieve the minimum spanning tree algorithm
MATLAB_MST
- 用MATLAB实现最小生成树,可以应用在网络分簇、计算权值等多种应用场合-Using MATLAB to achieve the minimum spanning tree, can be applied to network clustering, calculation of weight and many other applications
CodeOfACM
- 一些ACM题源码,包括部分北大poj上的题目和《新编常用算法及程序题解》里面算法的程序实现-some code of ACM problems
MST
- 以C++語言撰寫的,題目是給一個connected graph找minimal spanning tr-Written by C++ language, and subject to a connected graph is to find minimal spanning tree
1985485MinTree
- 最小生成树聚类算法,算法的实现方法很多,在此不一一介绍了-MST
15-4
- Example 编译:mpicc mst.c mst 运行:本实例中使用了5个处理器。 mpirun –np 5 mst 运行结果: Input the size of matrix:9 0 4 5 8 6 2 5 7 3 5 0 8 3 1 6 4 9 5 7 2 0 6 4 1 3 8 9 4 5 6 0 5 7 2 1 6 4 5 8 7 0 2 3 4 7 4 1 4 7 5 0 7 8 4 7 8 9 3 2 1 0 6 7 4 2
Primsuanfa
- 用prim算法求带权图的最小生成树,最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
MST
- 最小生成树的实现,算法思想源于《算法导论》-Implementation of the minimum spanning tree
MST
- Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tr-Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tree
btlanbaoshi
- 随即开始你就开发大赛报价库 魔兽图-MST