Search - mst set

Search - mst set - List

[Other] mst DL : 0: 最小生成树 MST的四种算法实现。包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
Date : 2025-07-02 Size : 3.74mb User : 黄劲松
[assembly language] MST-718code DL : 0: LCD MST方案718芯片整套源码。718芯片已下市，现提供出来给大家研究。-LCD MST program source code 718 chip set. 718 chips have been under the city, now offers up to everyone to consider.
Date : 2025-07-02 Size : 4.02mb User : yangwen
[Data structs] Primsuanfa DL : 0: 用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
Date : 2025-07-02 Size : 245kb User : 刘月
[CSharp] Prim DL : 0: 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree. The T, U and TE were seen as red dots and red edge set, VU as a blue dot set. Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side. The nature side of MST to ensure that this is safe. T starting from any root r, and gradually grow up to U = V, ie T contains all the vertices of C so far. MST to ensure that this time the nature of the tree T is a G MST. Because each side is to add the right tree as small as possible, so this is a " greedy" strategy.
Date : 2025-07-02 Size : 1kb User : 吕济根