# programming

**Repository Path**: sthituanwang/programming

## Basic Information

- **Project Name**: programming
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 4
- **Forks**: 4
- **Created**: 2021-04-27
- **Last Updated**: 2022-02-21

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# <font face="微软雅黑" size=6 color=#00ff00>**Algorithm**</font>
[List of data structures - Wikipedia.pdf](algorithm/List%20of%20data%20structures%20-%20Wikipedia.pdf)

## <font face="微软雅黑" size=5 color=#ff00ff>Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2</font>

+ Kruskal算法概括起来是，在一个图中（由edges 和vertices组成）找最小距离的edge，然后再找第二小距离的edge直到找出V-1个最小距离的edge（v是顶点数目vertices数目）。注意的是每一步找最小距离要保证新添加的edge不与已确定的之前的edges组成一个cycle
+ [Programiz-Kruskal's Algorithm](https://www.programiz.com/dsa/kruskal-algorithm)  
  >[Kruskal_Programmiz.c](algorithm/Kruskal_Programmiz.c)

+ [GeeksforGeeks-Kruskal's Algorithm](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/)
  > [kruskal_GeeksforGeeks.c](algorithm/kruskal_GeeksforGeeks.c)

+ [Kruskal algorithm和图形表示.pdf](algorithm/Kruskal%20algorithm%E5%92%8C%E5%9B%BE%E5%BD%A2%E8%A1%A8%E7%A4%BA.pdf)  
+ [克鲁斯克尔算法 - 维基百科，自由的百科全书.pdf](algorithm/%E5%85%8B%E9%B2%81%E6%96%AF%E5%85%8B%E5%B0%94%E7%AE%97%E6%B3%95%20-%20%E7%BB%B4%E5%9F%BA%E7%99%BE%E7%A7%91%EF%BC%8C%E8%87%AA%E7%94%B1%E7%9A%84%E7%99%BE%E7%A7%91%E5%85%A8%E4%B9%A6.pdf)  
+ [最小生成树之kruskal算法-blog.csdn.net](https://blog.csdn.net/flyljg/article/details/38776523?utm_medium=distribute.pc_relevant.none-task-blog-baidujs_baidulandingword-1&spm=1001.2101.3001.4242)
+ <iframe
    height=400
    width=600
    src="algorithm/kruskal_algorithm.mp4"
    frameborder=0

</iframe>  

## <font face="微软雅黑" size=5 color=#ff00ff>并查集算法Union-Find Algorithms</font>

+ [UnionFind.pdf](algorithm/UnionFind.pdf)  
+ > [并查集(Union-Find)算法介绍及例题讲解_Iaired的博客-CSDN博客.pdf](algorithm/%E5%B9%B6%E6%9F%A5%E9%9B%86(Union-Find)%E7%AE%97%E6%B3%95%E4%BB%8B%E7%BB%8D%E5%8F%8A%E4%BE%8B%E9%A2%98%E8%AE%B2%E8%A7%A3_Iaired%E7%9A%84%E5%8D%9A%E5%AE%A2-CSDN%E5%8D%9A%E5%AE%A2.pdf)  
  > [https://blog.csdn.net/Iaired/article/details/79006769](https://blog.csdn.net/Iaired/article/details/79006769)