Prims vs Dijkstra algorithm | MST vs SSSP

This video explains the difference between the Prims algorithm and the Dijkstra algorithm.Prims algorithm is used to find minimum cost spanning tree whereas the Dijkstra algorithm is used to find the single source shortest path for a graph.All the steps and data structures in both the algorithms are seemingly the same and so most beginners tend to confuse them to be the same.In this video, I will clarify the difference between them using simple graph examples and using dry run.

CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

======================================PLEASE DONATE=============================
==============================================================================

=======================================================================
USEFUL LINKS:

RELATED LINKS:

BLOG LINK:

[KushalBhatia]

The moment I studied Prims after Dijkstra, I knew your channel will definetly have a video on this topic. and found it is there. Thank you for the best quality content on DS & Algo.

[yashikajotwani]

Thank you for the best graph playlist!!

[PRANAVMAPPOLI]

Thanks for this playlist bro, this is the best playlist for graph. Recently i got placed in Walmart as SDE-III and your videos helped me somuch in my preparation. Thanks again!!!

[likhileshsuryabhanbalpande]

Excellent!!
I like your teaching style.
Straight to the point!

[jasmeenkaur]

plz make a sliding window playlist... please sir.. no one can teach like u . your playlist is always best for

[sreyastendulkar]

Nice explanation and was much needed video💯👌

[techykush]

amazing explanation sir 😍😍 and thanks a lot for such wonderful graph playlist

[basawarajshivashetty]

It's very clear explanation.. thanks so much👍👍

[kunalsoni]

my confusion has gone 💚😊 after watching this video

[coder]

Sir Pls make this vid sorting stack using recursion