Prim's algorithm | Minimum Spanning tree (MST) | Design & Algorithms | Lec-26 | Bhanu Priya

Minimum Spanning tree(MST) : Prim's algorithm clear explanation with example

[@hemanthprabhu8134]

I have tomorrow exam and I searched for prims algorithm in many videos and still was confusing, this video opened accidentally but its the best pakka 7 marks 😅 thanks ma'am 😊

[@003kazimehrabrashid4]

thank you madam, you explanation was very easy to understand. but i am afraid that at 12:05 'f' should be connected with 'e', you said that exactly though.

[@bharathmadival8055]

🙌

[@mr.incredible1715]

Exactly 😊

[@yogeshdharya3857]

For what reasons exactly will anyone dislike a crystal clear(in terms of explanation) video like this?

[@taleemmurtaza5041]

Amazing ma'am thoughts cleared thank you very much

[@brownfeminine]

At starting of the video l didn't get anything but by the end I was happy that ''Oh thank god this is very simple''😅 THANKS A LOT mam❤

[@prathyusha252]

Guys - Prim's algorithm yields the minimum spanning tree only when there are unique edge weights. The way she explained is correct. However, for this graph (where there are 2 pairs of edges with the same weights bd, ac and bc,df), Kruskal's algorithm is the efficient one. She could have chosen to use unique edge weights. Kruskal's would give you 22 as many of you mentioned

[@sarthakchandrayan5542]

we will get 22 in this method as well .In the last step the edges should be {f,e) and not {g,e}, because {f,e} has weight 5 which is less than 6 of {g,e}

[@DivakarGowdaMN]

​​@@sarthakchandrayan5542f is already visited na how can we revisit it

[@sarthakchandrayan5542]

@@DivakarGowdaMN if it has a lower value you can

[@minakshirawat3290]

@@sarthakchandrayan5542 same problem my answer is 23 and my friends answer 22 ,not understand how's right same question asked in today's exam

[@afnainshariff3163]

Thanks mam u r the best teacher of youtube

[@kondurivarun]

nice explanation keep rocking and inspire many more

[@n.syamala1090]

Ur explanation is too good mam do many more videos on data structures

[@pubalidas6903]

F should be connected to e. As it has minimum weight

[@BhagatBhutale..]

Video is Useful 👍

[@devratnasawaitul8844]

ans is wrong but got an idea how it actually work thnk u 😇

[@manpreetbrar-km7qg]

Mam jo weight hotta hai vertices ka vo kaise v likh sakte hai jaise a to b 4 diya apne ex. Me

[@aangyamishra1008]

Tq mam... For ur simply explanation... It made easy to understand this concept

[@indrareddy5436]

thats fine its ok

[@kavyasharma9018]

The most easy explanation

[@ishowertudu7405]

Mam.....the last connection would be between (f,e),not between (g,e). Then the answer will be 22

[@Abhishekyadav-kb5ni]

yeah i have the same doubt...

[@pushkarroy9740]

1 NOTE : In last step the edges should be {f,e) and not {g,e}, because {f,e} has weight 5 which is less than 6 of {g,e}

[@jayab4746]

Super explanied mam tq u so much

[@tulasichanga]

Mam I have one doubt. How to calculate the weight

[@sstelematicssstelematics2210]

Ty Mam....u explained really good

[@vinaykumar-pt1br]

what if we have a parallel edge in the graph should we remove it

[@Abdulsamad-1]

Ma'am you can choose F to E also na?

[@anjalidevi6483]

Tnquuu mam

[@srikantbaliarsingh7764]

Thank you so much,,help me for the next 1hour exam

[@VishalAnandTM]

Minimum spanning tree has a weight of 22 whereas your tree is 23 ... i suppose you made a mistake . f should be connected to both e and g

[@ImtiazAhmad-yw8do]

Yes , you are right

[@Odim65]

yaa you are right

[@sandipsarkar5261]

There should be the edge between f to e...not g to e...this is the mistake

[@ridhammodh2601]

yes you are right

[@prathyusha252]

Prim's algorithm yields the minimum spanning tree only when there are unique edge weights. The way she explained is correct. However, for this graph (where there are 2 edges with the same weight bd and ac), Kruskal's algorithm is the efficient one. She could have chosen to use unique edge weights. Kruskal's would give you 22 as you mentioned 👍

[@itzabhishek.]

Yes but you have to see from visited vertice and after visiting f to g only one path remains to e , thatwhy we have to visit g to e .. because in prims we can't go back after visiting any vertice...I hope so ...

[@daniyalhaidary3391]

Ma'am aap jo last m (ge )edge ko milaye h. Wo kya Sahi h

[@gowrijanarthanan9393]

good explanation thank you

[@muhammadaamir566]

Mam.....the last connection would be between (f,e),not between (g,e). Then the answer will be 22 not 23

[@GAGANDEEPGOWDAMLAIML--]

correct bro

[@offline5756]

Thank you ❤️

[@AbhishekThakur-fk7px]

Thank you so much mam.

[@amitsingh-qn7nv]

good video..

[@sattivideos8136]

The correct answer here is f to g and f to e not from g to e so that minimum spanning tree has weight of 22

[@user-zf8ii5qs3r]

Yes you are correct

[@infamous_SUSIL]

No she done correctly

[@adijaiswal8009]

U r ryt

[@kishorraj4751]

22 is correct answer

[@RajdeepDas-oo5gz]

Yep

[@yuvasriravi6987]

Thank you mam 😊

[@AdeshkumarAdeshraj-dy9fh]

mam , in step 6 where you choose light weight is wrong because weight of (f,e) is less then weight of (g,e).

[@pushkarkumar7173]

At last e-f will be connected instead of g-e

[@VardanSharma]

Yes you're correct I wonder how can she post it without even checking.

[@sabarinathem4146]

correct answer

[@mdmuzakkir6912]

madam plzz make vedio regarding branch and bound knapsack problem

[@aikarsharay6707]

Thank you

[@StrangerDon]

Thanks

[@RahulRaj-vv9fs]

aapki aawaz kitna aache hai :) >. .< 😍😍😍😍

[@sumitkumarmishra6483]

I think your's example ans is wrong because at final step (e-f) will be connected not (e-g)

[@buddhiniwalakuluarachchi8281]

i agree

[@RaviKumar-cz5ci]

@@buddhiniwalakuluarachchi8281 then it will be closed circuit...and we should take minimum value

[@ShivaKumar-ud8pt]

Thanks

[@pradhumnsirothiya]

last visited edges se min distance dekha jata hai bro.....

[@nilotpalsingh9096]

You are correct

[@kavyaganesh833]

Mam thank you

[@unboxinghonestreview619]

What is the difference in prims algorith and krushkal algorithm

[@csengineer8819]

prims algo work on vertices and krushkal algo work on edges

[@arunkumararun7407]

Mam is confused.but actualy answer is MST=22

[@sunnyKumar-jy6ui]

connection of e and g is 6 and e and f is 5 so i think it should be e to f which is of 5

[@khadizaaktereme6184]

why {f,e} can't be taken at the last step??? I think that is incorrect step to choose {g,e}.

[@anmol8630]

Can we do like this in university exams

[@iasanuradhagupta5463]

Why we don't start from c having least weight

[@cst51ritishadebnath62]

Last step is not currect. e connect with f not g , so minimum spanning tree has weight=22

[@sunithaparimi786]

Mam ur videos are really good understanding easily ur explanation step by step pls put a video for kmaps

[@akshatkumar1062]

I can help u with k maps in the easiest way of solving them

[@Ashimiim]

If we have loops or parallel paths?

[@tarequlislam9543]

just ignor loop and parallel paths(heighest weight)

[@taleemmurtaza5041]

First remove self loop and parallel edges then you find your mst with the given graph

[@Pastozafaire]

Thanks for posting this video, please check your answer as I also got 22 here are my chosen edges - ab(4), ac(8),cd(2),cf(1),ef(5) , fg(2); why choose eg instead of ef? ef has the lesser weight by 1.

[@Janakiram_999]

G is a visited vertex so connect e

[@bandiisreekanth1330]

How u take weights as 9 8 4 like this

[@bidetwacadet6525]

thx

[@hyn5070]

Mam please do videos on java and python it's humble request

[@shreysingh4463]

By krushals method it's answer is 22 but yours is 23 ?

[@umarbilal6150]

very helpful lecture

[@vishnumb526]

Sooper

[@shivarajh2167]

U made it easy.. Thanks mam

[@rohanprak]

its wron bro , dont follow , MST cost is 22 whereas she calculated as 23

[@hindupriya8763]

How to write weights madam

[@jahanahmed8308]

Mam u forgot the weight 5 edge....cost is 22

[@worldexcitingthings9309]

I think you teach us kruskal algorithms not prim's algorithms plz refer book

[@techniquerequest5050]

It's prims bro✌plz refer book

[@Levis40]

I want kruskal's algorithms for finding minimum spanning tree process please upload that video

[@reddygayathri031]

No it is correct what she said in this there should be least no if u have said Thai it for should be connected to e and g but first we have to check least value i.e f to e it has 5 and f to g it has 2 minimum so we have to take f to g so what she said is right

[@abinayap3858]

I think prim's algorithm using edges...

[@SluciferKm]

The minimum spanning tree has weight of 22 not 23

[@saitejavbss3200]

u said wroung total wroung

[@ranganathmannem7011]

tq for the explanation

[@saurabhbisht2668]

Ans is wrong it should be 22 and ur ans in 23

[@ashishpandey7344]

something went wrong mam

[@user-ix2ij4em9l]

What is the crt ans. mam...,? 22 or 23

[@s_h_reee7041]

Sircute .

[@sauravkumar3962]

This is wrong MSP will be 22 in this case....you have to join *f* and *e*....not g and e...🙄

[@azizulhakim2882]

something mistake mam

[@TaufiqShaikhkivines]

Mst is 22

[@KTMKING1703]

Mam 2 edges 9 , 9

[@ashish3saxena]

Very helpful

[@dheerajgupta6128]

There is a mistake

[@Abcdef-hq3vf]

Mam this was not the minimum spaning tree

[@bhaveshnikam5954]

WRONG ANSWER HE LASGT ME F-E SELECT KARANA THA

[@el_ilimitado]

## Attention guys: sorry ma'am but what u have demonstrated is not totally right. u said edges with minimum weight can be taken only from the latest visited vertex. but it can be taken from any visited vertex. I request u to recheck it. thank u

[@Aakash-mi8xq]

this method is wrong guys.Please do not refer it

[@tusharahmmed8952]

Why we don't go with b to c ? coz b to c = 4.

[@harrymanoharan]

This is wrong!

[@Explorewithrishabh8318]

Mam bahut complicated krdiya aapne...

[@manpreetbrar-km7qg]

Plzz reply

[@shankuntalaverma1413]

minimum spanning tree has 22 your answer is wrong

[@poorprogrammingcm663]

wrong answer

[@lifechange4464]

Ma'am apne f se e lena tha apka galat h

[@sahilkulshreshtha4465]

Your solution is wrong, min span can be 22 and in your case it is 23

[@rohanprak]

remove this video please , its not correct 1. teaching the wrong code 2. uploading the lecture video 3. not removing the video coz of views 4. result : dislike the video and unsubscribe

[@kerwal810]

Mam ye pabg to band kr lo

[@dheerajgupta6128]

Not explained well

[@halfengineer3236]

Wt =22 is correct and your ans is incorrect

[@Christ_Love_40]

Not crealry We are all learners not a lecturers

[@ayushjaiswal7298]

wrong answer...please rewatch the video before uploading

[@chachannel001]

MST is (4+8+2+1+2+6) = 23

[@jazeerabbas2889]

Malayali undooo

[@Srikrishna9999]

Learn English

[@lakshaysethi7927]

who else listened that mam mistakenly said sex 2:03

[@rishikashyap07]

It's wrong