Dijkstra’s Algorithm | Graphs | Min Heap | Priority Queue | Shortest Path | Animation

[@user-jf1vo7vv4b]

Great video, can't believe you only have 62 subscribers currently!

[@depthfirst1]

Hey, thanks for your kind words!

[@jancsi-vera]

I’m subscribing now, video is great😊

[@depthfirst1]

Thank you very much, appreciate it!

[@ashkane417]

Great video, hope this channel gets the recognition it deserves.

[@depthfirst1]

Thank you!

[@BlahBlah-zr8ie]

very good visualization, thank you. I was trying to find a video with the min heap visualization as well as the dictionary.

[@depthfirst1]

Glad it was helpful!

[@titocandraseptio7636]

this is the video i needed, easy to understand, thankyouu very much !!

[@depthfirst1]

Of course! Glad it helped!

[@benson4225721]

Really clear explanation, thank you!

[@depthfirst1]

You're very welcome! Glad it was helpful!

[@sallaklamhayyen9876]

great explanation = thank you so much 🥰🥰🥰

[@depthfirst1]

You’re welcome 😊

[@markuscwatson]

Great video. Thanks for sharing

[@depthfirst1]

Thanks for watching!

[@rostislav_engineer]

thank you for this video

[@depthfirst1]

You are very welcome!

[@avagreene5966]

this was so helpful thank you!

[@depthfirst1]

You're so welcome!

[@a.m.4154]

This is a weird algorithm because while it is easy, it is not exactly intuitive.

[@depthfirst1]

Yeah, Dijkstra's algorithm might seem unintuitive at first, but visualizing each step can help clarify it.