搜索资源列表
MST
- prime算法的基本思想 1.清空生成树，任取一个顶点加入生成树 2.在那些一个端点在生成树里，另一个端点不在生成树里的边中，选取一条权最小的边，将它和另一个端点加进生成树 3.重复步骤2，直到所有的顶点都进入了生成树为止，此时的生成树就是最小生成树-The basic idea of the prime algorithm. Empty spanning tree, take any a vertex joined spanning
mst
- NTFS multi sector transfer protection handling code. Part of the Linux-NTFS project.
MST
- 最小生成树,有向图，随便交一下，还要20字-Minimum Spanning Tree
ConsoleApplication1
- 最小生成树的代码 适合初学者使用 方便快捷-mst delauney voronoi
mstar-debug-tool
- 串口debug工具，可用于mst或其它方案，调试软件用-mst debug tool
mst
- NTFS multi sector transfer protection handling code. Part of the Linux-NTFS project.
intel_dp_mst
- for MST we always configure max link bw - the spec doesn t seem to suggest we should do otherwise.
drm_dp_mst_topology
- DOC: dp mst helper for Linux v2.13.6.
tegra-ahb
- AHB ARBITRATION AHB MEM WRQUE MST ID for Linux v2.13.6.
clustering-using-mst
- Minimum spanning tree-based clustering
upsampling_code_published
- 通过构建图像的mst，然后升采样，生成对应的视差图，效果较好；-By constructing an image of mst, then upsampling, generate a corresponding disparity map, the better
MST-
- 最小生成树的prim算法.可导入多种文件计算-Minimum spanning tree algorithm prim. You can import a variety of files on your computer
mst
- 程序为相关干涉仪测向方法的matlab仿真。以5元圆天线阵列为接收阵列，计算两元间的相位差，形成标准库，并通过相关的方式测得信号来波方向。-Matlab simulation of the program for the direction finding method of correlation interferometer. With 5 yuan of circular antenna array for receiving array, calculate the phase diff
Hk_9
- 图论中的最小生成树(MST)算法，源代码。函数入口为Main-MST algorithms sourse code
2nd-MST
- 采用两轮最小生成树构建复杂网络，并观察鲁棒性和平均路径长度的变化-The complex network is constructed with two rounds of minimum spanning tree, and the changes of the robustness and average path length are observed.
into-iource
- Matlab software conversion program, such as the MST good source into SAP
MST-kruskal
- The classic kruskal algorithm is implemented Import: adjacency matrix Output: Minimum spanning tree
47430896
- 一些用matlab编制的软件转化程序,如mst转换到sap中 不错的源码(Matlab software conversion program, such as the MST good source into SAP)
最小生成树之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
BINO
- 双目立体匹配算法 基于最小生成树的双目匹配(Binocular matching based on MST)