2022.2.15

I'm not feeling well today

• Supplementary questions P4779 【 Templates 】 Single source shortest path （ The standard version ）
• Learn to generate the smallest tree （ Not yet learned. .）
• To study the sort overloaded c++ in sort overloaded _m0_62742402 The blog of -CSDN Blog

among kruskal Than prim It's a little bit easier to understand .

 

These videos explain the principle very clearly , But the hard part is the code implementation

Minimum spanning tree (Kruskal( Kruskar ) and Prim( Prim )) Algorithm animation demonstration _ Bili, Bili _bilibili

 2 Minutes to understand the minimum spanning tree prim Algorithm _ Bili, Bili _bilibili

 

 prim More suitable for dense graphs ,kruskal It is more suitable for dealing with sparse graphs  

To find out m side ,n The minimum spanning tree of a graph with vertices , The time complexity of Kruskal algorithm is O(m log m) The time complexity of prin algorithm is O(m log n), therefore For sparse graphs , Kruskal algorithm is simpler , otherwise , There is no difference in the complexity of the two algorithms .