搜索资源列表
mst
- 最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
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
MST
- 以C++語言撰寫的，題目是給一個connected graph找minimal spanning tr-Written by C++ language, and subject to a connected graph is to find minimal spanning tree
dijekstra
- its dijekstra algorithm for find mst
CS2208_DSLab_Programs
- CS2208 - Data Structures Lab (Anna University) EXERCISES 1a. Implement singly linked lists. 1b. Implement doubly linked lists. 2. Represent a polynomial as a linked list and write functions for polynomial addition. 3. Implement stack and
MST
- 最小生成树,有向图，随便交一下，还要20字-Minimum Spanning Tree
mstar-debug-tool
- 串口debug工具，可用于mst或其它方案，调试软件用-mst debug tool
clustering-using-mst
- Minimum spanning tree-based clustering
Hk_9
- 图论中的最小生成树(MST)算法，源代码。函数入口为Main-MST algorithms sourse code
MST
- 输入邻接矩阵，输出MST算法所得过滤结构子图。(Input the adjecent martix, outpur the MST.)
最小生成树之kruskal算法
- 最小生成树之kruskal算法的概念及其实现 kruskal算法的精髓在于： 每次选取一条边。 该边同时满足：1、在当前未选边中权值最小；2、与已选边不构成回路。 直到选取n-1条表是算法结束。找到MST活判断不存在MST。(The concept and implementation of Kruskal algorithm for minimum spanning tree The essence of Kruskal algorithm lies in: Select one
MST
- MSTAR FOR CPU SOFTWARE FLASH