Prim's algorithm for Minimum Spanning Tree with Example |

[@EasyEngineeringClasses]

New Updated Lecture with More Solved Examples - kzbin.info/www/bejne/jYbSZntqgNONatE

[@alika7328]

I understand the parts in Hindi even though I don't speak it a word of it :') Great teacher :)

[@UniverseGOD2525]

lol

[@AJ-te4jn]

👏👏👏

[@saranshsaha6348]

Much appreciated. Keep supporting us ❤

[@ganeshsharma6326]

Lol😂

[@Anand-wi4yb]

Even youtube is not able to figure out which language he speaks. Auto-generated subtitles are in Portuguese or Turkish in most of his videos

[@samawan7363]

great work bro. parallel edges dimagh ghuma rahi thi smj gya ab thanks alot

[@NeyJrGaming]

Saal bhae college nahi gya ab youtube ki help se doubts clear ho re h 😂😂 thank you sir ji

[@mahnoor236]

Sir your lecture is so good

[@divyareji5222]

It was a very clear explanation sir!😊👍. U teach so well! Thanks a lot! I have cleared my doubts very well through your tutorial.😇

[@mdsafdarali1314]

Divya Reji very helpful for me . even i was very depress about the topic after watched i have clear my doughts

[@aayushkumar7138]

it is very clear

[@hirenmotwani8100]

respected sir, your explanation is awesome and easy to understand. again thank you for you and your channel for giving tutorial like this it is very helpful for us thank you so much

[@saikatmazumder4724]

very clear nice to understand..thnx

[@rahuljadhav-wq9dx]

Your are very good sir....

[@tejamurachitte8728]

Amazing explanation sir..

[@mdanisahmed3155]

Thank you so much for this effective tutorial ,,,

[@asftelecasts7484]

awesome expilination sir

[@EasyMaths_official]

my vdo on hasse diagram

[@Premprakash-wj9dm]

U explained perfectly.

[@sakshiprajapati2197]

kamaal hai sir....

[@dikshathakur9204]

Very good explanation 👍

[@Naturelover0078-z3k]

thanks a lot sir👌👌❤

[@gauravkumarjangid3517]

i can not thank you in words however thax you so much sir.

[@vamsipaidupalli7904]

Thanks sir for your kind words for understanding

[@utsabsamanta1614]

Thanx,it helped 😊

[@apporvaarya]

Sirg u are the best

[@krushaldobariya5379]

Thanks! 👍🏻

[@maddyrocks4626]

great explanation in hindi

[@SanjeetKumar-ux4oq]

awesome lecture sir...

[@shourya0690]

This is the best explanation ❤

[@BhaveshSinghBhanucsgo]

Kal mera paper hai...mere dua krna guys ki pass hojaun...

[@ankithanaik6011]

Clear explanation sir...tnq u..

[@jarvissova]

Best explanations!

[@naveenshaik9733]

TQ sir it helps me a lot

[@piyushparadkar6290]

thanks a lot brother

[@rushceo3119]

Fy mtech stud. Thanks for this sir..

[@karanrajput-yo2wu]

Thank You So Muuuuuuccch Brother......

[@MrHowTo-cw2op]

thanks for simple explanation

[@moxin84]

Very helpful... thanks

[@SummiasElegantFashion]

V gd explanation sir thnxxx a loot sir

[@shubhambhatia6504]

Very nice

[@swatiyadav2122]

Thanks a lot.. for this video ❤️

[@rajatkumar5374]

AAP KAHA SE HO

[@hitanshulodhia6063]

Amazing, simply amazing

[@z7835]

good explanation sir

[@siddharthvadakkedath6616]

Super easy explaination

[@ManishKumar-mi7ko]

big thanks to you

[@ronaksain2971]

Nice video

[@The-Sid.S]

Thank you bro

[@DeepakKumar-ox5ti]

Nice sir, superb.

[@AshokKumar-qx8wh]

Tree is a acyclic graph so there is no need repeat the fact that spanning tree shouldn't have any cycle.

[@MohitK96]

Explaining example through implementation of algorithm is different thing. Taking example and performing operation is easy for human mind but computer do through implementing algorithm

[@shubhamjha5738]

Directed graphs k liy v applicable hai kya?

[@laxmanrajpoot]

Very nice explanation sir thanks

[@NagaBhavani19962112]

thank you

[@Sanatanabhishekaa28498]

thanks from Kerala

[@anuradhachaturvedi5054]

Sir u did it thnq

[@piyushsaini6093]

Please teach knapsack problem Greedy algo. Divide and conquer Dynamic programming Huffman coading Knuth Morrie's algo String matching problem Convex hull Fft Strassens algo Inter arithamatic

[@yudingzhou8683]

great! thanks!

[@sakshipatel2549]

Sir kruskals algorithm and prims algorithm me ky difference hai plz reply

[@kriteekamehta4437]

described well

[@harshsingh8399]

The only difference between prims and kruskal is presence of disjoint set in kruskal and no disjoint set in prims ......

[@ImtiazAhmad-yw8do]

we selected lowest cost edge in Kruskal algo , rather then Prim's

[@SUBHROBARDHANBEM]

haan mein subhro huin ! :-) proud 2 B

[@diivyasha1949]

Lovely😇

[@snehilmaliwal4554]

Thank you sir.

[@priyankasinha2686]

wow... itz make ezy to me..

[@aakashgautam3377]

Isme jo ye weight h vertices k ...ye hmne khud assume Kiya h ya given h ???

[@ragingdragonii1783]

Given hote hai question me

[@vasanthanv6143]

Sir when it comes to choose between. "c " or "d" ,if we choose "d" .is the sum wrong?

[@muhammadmuneebkhanafridi154]

Besttt!

[@tanushreenagar3116]

Thnk u

[@maddyrocks4626]

sir time complexity bhi bata dete toh acha rahta

[@changeDgame47]

can you please explain MST using dijkstra's algorithm?

[@Atul26019]

Thanks Sir

[@omkumawat4543]

Sir pass kara diya

[@vipnirala]

sir why didn't you use diagonal edge as least weighted edge first

[@haripal5129]

Ok thanks vedio

[@deepikasharma1370]

Sir why we not consider weights 6 and 8

[@talharauf3111]

gREAT

[@avnishsingh5620]

Sir ex 1 m apne minimum edge li h n ex 2 apne random node s start kia h which one is correct???

[@aayushkumar7138]

awesome

[@ahsanshahid9240]

thanks

[@piyushmunjal8934]

i saw both topics kruskal and prims in both videos you did in same way

[@pulkitsharma431]

Bsdk class mai pad lia kar itna hi hai to Sallaa FUNGUS

[@creative1878]

great

[@krishnak1571]

Bro your voice is like Telugu music director Devisri prasad😊

[@Anand-wi4yb]

Even youtube is not able to figure out which language he speaks. Auto-generated subtitles are in Portuguese or Turkish in most of his videos

[@vishnujatav6329]

thans

[@huyvole9724]

KZbin's Engsub can't translate your eng.

[@BhaveshSinghBhanucsgo]

Understand the feelings 😂😂

[@jsps011]

tq sir..

[@yamislive1951]

Sir ..yadi 2 edges ke saath me ek parallel edge he to usko kese remove krenge ...plz sir jldi bta dijiye ...kl exam he

[@ahmadaslam3722]

kaya hum kaheen sy b shuro kr skty hai

[@Melody_Adda]

Gud

[@shehrozeaslam702]

Plz tell me the calculating time of prims algorithm which is implemented using SPQ (it is a special kind of priority queue)

[@shaikazmathulla4981]

What is the difference between kruskal's and prims algo

[@mdmsar8590]

sir upload the video offf binomial queues

[@MT-wt7tn]

Why didn't we start from edge (b,c) in 2nd example? It's clearly the shortest one.

[@diivyasha1949]

Mohit Thakur bcoz hv to remove loops and parallel edge first he started from A to B

[@abdulwahabnizamani5004]

it is same as to kruskal algorithm. so what is difference between prims and kruskal

[@TechnicalAkkhi]

yes bro its same with the krushkals algorithm.....,even explaineed video i9n this is krushkals only

[@amirrazaq6367]

i think you kill this ...thank you for uploading

[@gauravrai2508]

sir in example -2, why didn't you start with b to c? which is having minimum weight..

[@hmanusri]

You can do that too.. Ek hi baat hai, finally answer wahi ayega so sir ka aaya hai.

[@vinamervakunthvansil4077]

In prim's algo , we start with any random vertex whereas in the kruskal's algo we start with the minimum weighted edge! So it doesn't matter even if the first vertex is different.

[@armelstsrt]

That's only relevant for Kruskal's algorithm. Prim's can start from any vertex

[@rockerchampyt65]

Cod to engineering WOWWWWW

[@sabreentajakkur5151]

How to write remaining vertices sir

[@Sattya998]

sir,why didn't you start from b to c in second example...i am asking w.r.t first example

[@virajdalvi6311]

koi bhi path le chalega sirf minimum weight rehna chahiye

[@vasulalkiya3823]

👌

[@ahmadaslam3722]

yani k kisi b edge sy

[@jay22372]

you count 5num of same to edged

[@ronnybanerjee6020]

sir just to be clear, when following step 3 of Prim's algorithm(i.e. finding neighbors of all vertices in V ' whose one end-point belong to V ' and the other not belonging), are we putting that new end-point added in the diagram to the set V' ?? And is this how it will be V = V' in the end when the program stops?

[@monil1601]

Ya. I think what u said is true

[@rareangel15]

🔥👍

[@salehinafnan]

Wow