搜索资源列表
MST-Player-v1.5
- 运动目标识别，采用背景差分方法。背景图像由均值法获得。里面的视频换成前几帧换成纯背景效果能更好一点-Moving target identification, using the background difference method. Background image obtained from the mean. Which replaced the previous video frame replaced by pure background a little better resul
Prim-MST
- 实现自建无向图，生成多生成树，MFC图形界面 c-To achieve self undirected graph, generate multi-spanning tree, MFC graphical interface to C++
segmentationTreeThrust
- CUDA Segmentation Tree Thrust Library This sample demonstrates an approach to the image segmentation trees construction. This method is based on Boruvka s MST algorithm.
mst
- 构造可以使n个城市连接的最小生成树，《数据结构》课程设计，VC++编写，VS2008环境。-Construction can make n city is connected to the minimum spanning tree," data structure" course design, VC++, VS2008environment.
prim_mst
- prime最小生成树,数据结构，图论算法-prime MST
TSP
- TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
TSP-Heuristics
- Another version of TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
dijekstra
- its dijekstra algorithm for find mst
mst
- 模式识别中的最小生成树聚类，自己编写，没有用函数-Minimum spanning tree clustering
Prim_heuristic_16_nodes
- A Prim s variation for use on Wireless Sensor Networks. We choose as next node to add to the MST, the node with max. residual energy.
MST
- 本程序基于c++生成了最小生成树，-The program is based on the c + + to generate a minimum spanning tree,
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
codes.zip
- various codes in c++ on huffman,mst tree,various codes in c++ on huffman,mst tree
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
Java-programming
- java codes,里面包括bin_sort,ins_sort,mst,opt_bin,radix_sort等等。-java codes developed by java, including bin_sort,in_sort and so on.
QFP12814X20
- MST 718 719 QFP128 PACKAGE
ConsoleApplication1
- 最小生成树的代码 适合初学者使用 方便快捷-mst delauney voronoi
mstar-debug-tool
- 串口debug工具，可用于mst或其它方案，调试软件用-mst debug tool