A Software Engineering Space

Prim’s Minimum Spanning Tree Algorithm

Having covered Kruskal’s MST algorithm in my last article, it seems only natural to now cover Prim’s MST algorithm. Prim’s algorithm is another Greedy Best First Search graph algorithm for finding the minimum spanning tree of an undirected weighted graph. Functionally, it is very similar to the priority queue Lazy implementation of Dijkstra’s Algorithm. The […]

Kruskals Minimum Spanning Tree Algorithm

It’s been a while since I’ve posted anything graph related, and I’ve been meaning to cover Kruskal’s algorithm for a while because I find it beautiful in its simplicity. Kruskal’s algorithm is used to find the minimum spanning tree of an edge weighted undirected graph. Supporting Data Structures Being a Graph algorithm, we will obviously […]