Amazing ma'am thoughts cleared thank you very much

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.

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 😊

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❤

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

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

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

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

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

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

nice explanation keep rocking and inspire many more

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

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

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

Mam your my god for all the subjects because of u I will win and score good marks in my exam really thank you so much mam it means a lots 💓☺️☺️

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

Mam I have one doubt. How to calculate the weight

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

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 ...

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

Super explanied mam tq u so much

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

The most easy explanation

Ty Mam....u explained really good

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

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

What is the difference in prims algorith and krushkal algorithm

Video is Useful 👍

Thanks mam u r the best teacher of youtube

Algorithm bolta hai select unvisited vertex which is adjacent of visited vertices isiye g to e hoga kyuki f se to g tak visited ho chuka hain phir f kaise hoga

madam plzz make vedio regarding branch and bound knapsack problem

Why we don't start from c having least weight

Tnquuu mam

Can we do like this in university exams

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

good explanation thank you

Thank you so much mam.

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

Thank you ❤️

Mam is confused.but actualy answer is MST=22

How u take weights as 9 8 4 like this

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.

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

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

If we have loops or parallel paths?

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

Thank you mam 😊

Thank you

Mam thank you

How to write weights madam

Thanks

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

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}

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

good video..

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

something went wrong mam

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

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

u said wroung total wroung

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

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

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

thx

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

U made it easy.. Thanks mam

something mistake mam

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

Mam this was not the minimum spaning tree

very helpful lecture

I think prim's algorithm using edges...

The minimum spanning tree has weight of 22 not 23

There is a mistake

Sooper

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

tq for the explanation

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

Mam 2 edges 9 , 9

Mst is 22

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

Very helpful

Sircute .

WRONG ANSWER HE LASGT ME F-E SELECT KARANA THA

## 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

Mam bahut complicated krdiya aapne...

minimum spanning tree has 22 your answer is wrong

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

Plzz reply

this method is wrong guys.Please do not refer it

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

Mam ye pabg to band kr lo

Wt =22 is correct and your ans is incorrect

This is wrong!

Not explained well

wrong answer

wrong answer...please rewatch the video before uploading

Not crealry We are all learners not a lecturers

Malayali undooo

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

who else listened that mam mistakenly said sex 2:03