Could have really used code examples for Prim, Kruskal, Dijkstra, BF, SPFA

I know, I know. If you are good at coding, this will come naturally to you. I ain't a beginner either but, it'll be good to have a code shown along with the broad example. I understood Union Find so well because it went hand in hand with explanation. Everything else? Downhill within no time. Only exceptions are DFS and BFS which I had a lot of practice in.
I learnt all adj matrix versions of these algorithms and the internet is full of them. I could use some guidance in Optimized DS way of implementing these algorithms.

Comments (2)