Prims vs Dijkstra algorithm | MST vs SSSP

Sdílet
Vložit
  • čas přidán 22. 04. 2021
  • 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=============================
    🧡 SUPPORT OUR WORK: / techdose
    💚 UPI-ID: surya.kahar@ybl
    💞JOIN Membership: / @techdose4u
    ==============================================================================
    INSTAGRAM : / surya.pratap.k
    LinkedIn: / surya-pratap-kahar-47b...
    WEBSITE: techdose.co.in/
    TELEGRAM Channel LINK: t.me/codewithTECHDOSE
    TELEGRAM Group LINK: t.me/joinchat/SRVOIxWR4sRIVv5...
    =======================================================================
    USEFUL LINKS:
    💙DSA Crash Course: • DSA Crash Course Expla...
    🟠Must do TIPS to ACE Virtual Interview: • 🔴Must do Tips to ACE y...
    🟢Best strategy to excel your coding interview: • 🔴Best strategy to exce...
    🟡Get your dream job in 1 month: • 🔴Get your dream job in...
    🔵How to crack dream job in just 2 months: • How to crack dream job...
    🟣7 Days DSA plan: techdose.co.in/7-days-dsa-che...
    RELATED LINKS:
    Prims Algorithm: • Prims algorithm | MST ...
    Dijkstra Algorithm: • Dijkstra algorithm | S...
    BLOG LINK:

Komentáře • 37