There is a really cool course on Coursera regarding Union-Find. The course was quite refreshing because I was never exposed to this simple concept before.
I just wanted to share the link for those learning graph theory as I am.
Now comes the boring stuff (how I found out about it and what I did with it).
I’ve spent about 3 days trying to implement Dijkstra’s algorithm after watching a YouTube video.
I’ve implemented three times (once a day) but on the 3rd day, I finally succeeded.
This entry is neither going to be about what Dijkstra’s algorithm is nor how the implementation works. I will just talk about steps I took to implement it and post the full source link on the bottom.