Minimum spanning tree algorithm and bipartite graph algorithm

There are two minimum spanning tree algorithms. One is prim algorithm and the other is Kruskal algorithm. The time complexity of the two algorithms are o (n^2) and O (mlogn) [n is the number of points and m is the number of edges]. The two algorithms behave differently in different graphs. Let's start with prim algorithm. The core idea of thi ...

Posted by FaT3oYCG on Sun, 13 Feb 2022 11:57:46 +0100

Summary of typical minimum spanning tree algorithms~

Classification of minimum spanning tree 🐖: The minimum spanning tree is generally used for undirected graphs, and directed graphs are rarely used. Method selection: Dense graph: using naive Prim algorithm Sparse graph: using Kruskal algorithm Heap optimized Prim is not commonly used! Plain Prim The general idea can be referred to Dijks ...

Posted by schme16 on Tue, 18 Jan 2022 17:59:39 +0100