DAA68: Minimum Spanning Tree Prim's Algorithm Pseudocod|Prims Algorithm Step by Step Solved

[@bhavyabhagwani5407]

I kept searching for someone to explain the program and algorithm this way. Thankfully I got this❤️❤️ Very nice and apt explanation!👍👍

[@shubhamtyagi60]

Dear sir you did too much effort to clear everything thank you sir 🙏

[@Rubinayousaff]

You're just amazing. Stay blessed

[@adilansari8414]

Awesome lecture. Pr Time complexity bhi clear krde.. Please

[@Punamkumari-if4nq]

Thank you Sir

[@krishnavarshney1935]

Sir, plz BFS and DFS algorithm pr lecture upload kriye

[@a3rdtierguy864]

YE mai sare cheezo ko agar statement me likh du to kya marks milenge

[@Sunil66851]

Sir in prims algorithm if the length of minimum spanning tree is 24 and i got answer as 28 then its correct or wrong ?

[@AniruddhSinghIndia]

no

[@Asad_Abbas_Bhatti]

Bfs and dfs algorithm

[@sidhujain6056]

What is its complexity?

[@create_the_world665]

sir, in second question when we considered all node i.e, a, b, c, d, i, f, g, h, .... for next step you cosidered edge having weight 9 [d,e].... why not [i,g] hving weight 6

[@ramanujdodiya6730]

Cycle bann jayega

[@akhilesh_14_]

Thanks
@@ramanujdodiya6730

[@nancyvaish8495]

In example 1 ...why we have not visited b through t in last

[@deepanshuaggarwal7042]

Time complexity wala part cut kar diya aapne

[@muneshkumar4805]

Sir Time complexity of prim s algorithm

[@Usurperhk]

same as kruskal

[@ravi86313]

space complexity also

[@ravi86313]

how to calculate complexity

[@Hamzul.]

is he speaking english or hindi

[@zukakiarimota455]

hindilish