Articles by Team EasyExamNotes

Kruskal’s algorithm

Kruskal’s algorithm is another popular algorithm for finding the minimum spanning tree (MST) of a weighted undirected graph. It is based on sorting the edges … Read more

Prims algorithm

Prim’s algorithm is a greedy algorithm used to find the minimum spanning tree (MST) of a weighted undirected graph. A minimum spanning tree is a … Read more