📄️ Prim’s Algorithm — Minimum Spanning Tree (MST)
In this post, we will explore Prim’s Algorithm, a greedy approach used to find the Minimum Spanning Tree (MST) of a weighted, undirected graph. We’ll also implement the algorithm in Go and walk through a visual example to solidify your understanding.
📄️ Dijkstra's Algorithm
Feel free to follow my work on GitHub: Dijkstra Algorithm in Go.