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 😊
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.
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 👍
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
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 ...
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
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
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}
## 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
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.
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 😊
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.
🙌
Exactly 😊
Thanks mam u r the best teacher of youtube
Ya❤
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
Yes , you are right
yaa you are right
There should be the edge between f to e...not g to e...this is the mistake
yes you are right
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 👍
Ty Mam....u explained really good
Thank you mam 😊
good video..
madam plzz make vedio regarding branch and bound knapsack problem
Can we do like this in university exams
why {f,e} can't be taken at the last step???
I think that is incorrect step to choose {g,e}.
this method is wrong guys.Please do not refer it
very helpful lecture
If we have loops or parallel paths?
just ignor loop and parallel paths(heighest weight)
First remove self loop and parallel edges then you find your mst with the given graph
There is a mistake
Mam this was not the minimum spaning tree
I think prim's algorithm using edges...
tq for the explanation
wrong answer
Wt =22 is correct and your ans is incorrect
Malayali undooo
Learn English
MST is (4+8+2+1+2+6) = 23
chal teri
aray camera to sahi se rakhna seekho na
F should be connected to e. As it has minimum weight
True...
Mam.....the last connection would be between (f,e),not between (g,e).
Then the answer will be 22 not 23
correct bro
Mam.....the last connection would be between (f,e),not between (g,e).
Then the answer will be 22
yeah i have the same doubt...
I think your's example ans is wrong because at final step (e-f) will be connected not (e-g)
i agree
@@buddhiniwalakuluarachchi8281 then it will be closed circuit...and we should take minimum value
Thanks
last visited edges se min distance dekha jata hai bro.....
You are correct
ans is wrong but got an idea how it actually work
thnk u 😇
WRONG ANSWER HE LASGT ME F-E SELECT KARANA THA
This is wrong MSP will be 22 in this case....you have to join *f* and *e*....not g and e...🙄
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
Mam is confused.but actualy answer is MST=22
Last step is not currect. e connect with f not g , so minimum spanning tree has weight=22
Not explained well
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 ...
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
Yes you are correct
No she done correctly
U r ryt
22 is correct answer
Yep
u said wroung total wroung
Mam I have one doubt.
How to calculate the weight
Ma'am you can choose F to E also na?
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
nice explanation keep rocking and inspire
many more
The minimum spanning tree has weight of 22 not 23
At last e-f will be connected instead of g-e
Yes you're correct I wonder how can she post it without even checking.
correct answer
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}
who else listened that mam mistakenly said sex 2:03
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
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}
@@sarthakchandrayan5542f is already visited na how can we revisit it
@@DivakarGowdaMN if it has a lower value you can
@@sarthakchandrayan5542 same problem my answer is 23 and my friends answer 22 ,not understand how's right same question asked in today's exam
Video is Useful 👍
What is the crt ans. mam...,? 22 or 23
Ans is wrong it should be 22 and ur ans in 23
I think you teach us kruskal algorithms not prim's algorithms plz refer book
It's prims bro✌plz refer book
This is wrong!
Mam jo weight hotta hai vertices ka vo kaise v likh sakte hai jaise a to b 4 diya apne ex. Me
## 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
Ma'am apne f se e lena tha apka galat h
Is she drunk ???
Galat padhati hoo -22 hoga ans
mam , in step 6 where you choose light weight is wrong because weight of (f,e) is less then weight of (g,e).
It's wrong
Sircute .
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 💓☺️☺️
wrong answer...please rewatch the video before uploading
Your solution is wrong, min span can be 22 and in your case it is 23
What is the difference in prims algorith and krushkal algorithm
prims algo work on vertices and krushkal algo work on edges
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❤
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
Ma'am aap jo last m (ge )edge ko milaye h. Wo kya Sahi h
Amazing ma'am thoughts cleared thank you very much
Mst is 22
Tnquuu mam
you have to show full paper the video is not correct
minimum spanning tree has 22 your answer is wrong
By krushals method it's answer is 22 but yours is 23 ?
something mistake mam
Ur explanation is too good mam do many more videos on data structures
Not crealry
We are all learners not a lecturers
Why we don't start from c having least weight
How to write weights madam
Mam u forgot the weight 5 edge....cost is 22
Mam ye pabg to band kr lo
wrong answer bhai logo
Mam please do videos on java and python it's humble request
How u take weights as 9 8 4 like this
Mam bahut complicated krdiya aapne...
Plzz reply
Thank you so much mam.
Mam 2 edges 9 , 9
good explanation thank you
Mam thank you
Thank you so much,,help me for the next 1hour exam
Super explanied mam tq u so much
Thank you
For what reasons exactly will anyone dislike a crystal clear(in terms of explanation) video like this?
If ur interested watch this video or do not open this video
@@mithun7392u understand English ? I doubt that 😆🤦🤦
Thank you ❤️
Sooper
aapki aawaz kitna aache hai :) >. .< 😍😍😍😍
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.
G is a visited vertex so connect e
something went wrong mam
what if we have a parallel edge in the graph should we remove it
The most easy explanation
thx