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 😊
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}
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 👍
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 ...
No that's wrong.... That means f is visited but e is not visited so I can join f and e.... F is already visited and c is already visited so I can't join both...
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.
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
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
## 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
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
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 😊
yes
So brother did you pass the exam ?
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 😊
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
Thanks mam u r the best teacher of youtube
Ya❤
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
Video is Useful 👍
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 👍
F should be connected to e. As it has minimum weight
True...
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 💓☺️☺️
nice explanation keep rocking and inspire
many more
The most easy explanation
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}
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 ...
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...
ans is wrong but got an idea how it actually work
thnk u 😇
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
Ma'am you can choose F to E also na?
Mam I have one doubt.
How to calculate the weight
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
Mam.....the last connection would be between (f,e),not between (g,e).
Then the answer will be 22 not 23
correct bro
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 😆🤦🤦
Mam said that second step is to select the unvisited vertex f is already visited vertex but e is the new vertex thats the reason for selecting (e, g)
No that's wrong.... That means f is visited but e is not visited so I can join f and e.... F is already visited and c is already visited so I can't join both...
Amazing ma'am thoughts cleared thank you very much
Ur explanation is too good mam do many more videos on data structures
mam , in step 6 where you choose light weight is wrong because weight of (f,e) is less then weight of (g,e).
in 12:07 the f node should be connnected with e
Tq mam... For ur simply explanation... It made easy to understand this concept
thats fine its ok
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
Mam is confused.but actualy answer is MST=22
Mam jo weight hotta hai vertices ka vo kaise v likh sakte hai jaise a to b 4 diya apne ex. Me
Last step is not currect. e connect with f not g , so minimum spanning tree has weight=22
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
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
why {f,e} can't be taken at the last step???
I think that is incorrect step to choose {g,e}.
Mam ur videos are really good understanding easily ur explanation step by step pls put a video for kmaps
I can help u with k maps in the easiest way of solving them
Ty Mam....u explained really good
Can we do like this in university exams
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❤
Ma'am aap jo last m (ge )edge ko milaye h. Wo kya Sahi h
How to take weights from this algorithms mam
class notes ( pdf )
education4u.in/
This is wrong MSP will be 22 in this case....you have to join *f* and *e*....not g and e...🙄
Why we don't start from c having least weight
Super explanied mam tq u so much
aapki aawaz kitna aache hai :) >. .< 😍😍😍😍
By krushals method it's answer is 22 but yours is 23 ?
How u take weights as 9 8 4 like this
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
Mam u forgot the weight 5 edge....cost is 22
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
Solution is wrong
Connect f to e instead of g to e it will make cost 22 without violating any rule
How to write weights madam
Thank you mam 😊
Ans is wrong it should be 22 and ur ans in 23
u said wroung total wroung
what if we have a parallel edge in the graph should we remove it
The minimum spanning tree has weight of 22 not 23
Thank you so much,,help me for the next 1hour exam
good explanation thank you
What is the difference in prims algorith and krushkal algorithm
prims algo work on vertices and krushkal algo work on edges
good video..
Thank you ❤️
What is the crt ans. mam...,? 22 or 23
Mam this was not the minimum spaning tree
U made it easy..
Thanks mam
its wron bro , dont follow , MST cost is 22 whereas she calculated as 23
Thank you so much mam.
madam plzz make vedio regarding branch and bound knapsack problem
## 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
this method is wrong guys.Please do not refer it
Tnquuu mam
Your solution is wrong, min span can be 22 and in your case it is 23
I think you teach us kruskal algorithms not prim's algorithms plz refer book
It's prims bro✌plz refer book
There is a mistake
minimum spanning tree has 22 your answer is wrong
Why we don't go with b to c ? coz b to c = 4.
Thank you
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
Mam thank you
something mistake mam
something went wrong mam
Mam please do videos on java and python it's humble request
WRONG ANSWER HE LASGT ME F-E SELECT KARANA THA
Sooper
I want kruskal's algorithms for finding minimum spanning tree process please upload that video
Ma'am apne f se e lena tha apka galat h
Mam 2 edges 9 , 9
I think prim's algorithm using edges...
very helpful lecture
❌Wrong answer
you have to show full paper the video is not correct
Not crealry
We are all learners not a lecturers
Wt =22 is correct and your ans is incorrect
Mst is 22
Thanks
Very helpful
Not explained well
wrong answer...please rewatch the video before uploading
This is wrong!
who else listened that mam mistakenly said sex 2:03
Sircute .
thx