It has been a long time that I am here at your channel... Now I can say with full of confidence that teacher does't matters is just a myth... Respect for you from the bottom of heart....
Very well explained Thanks . Sir can you help me how to solve maths problem in competitive programming (to ace a job) and what number theory concept we should study ?
How will it impact if I tweak the question, say if the same path has been taken twice (assuming undirected graph) the cost of travel is zero. Kindly Include this also in your implementation.
You missed one thing, ie.. Number of Spanning Trees that can be generated from a given tree NumberOfSpanningTree= (EC|V-1| - number of cycles) where C represents Combinations like nCr
It has been a long time that I am here at your channel...
Now I can say with full of confidence that teacher does't matters is just a myth...
Respect for you from the bottom of heart....
Thanks
Again, founding your channel made me more interested in algorithms and competitive programming. Thank you. Your explanation is mind-blowing.
Thanks :)
This video is Minimum Time Spanning video for understanding Spanning tree & MST. Best teaching Sir.
Thanks :)
complete package ... maza aa gaya. thank you
Welcome
Helpful video 😊
Thank you sir so much
This Graph series is bestest on whole UA-cam..
I am loving the topic i feared the most... Awesome explanation 🙏🏼
Thanks for video. Looking forward to Prims and Kruskal and then also to learn why Dijkstra can’t be applied to find MST.
stackoverflow.com/questions/1909281/use-dijkstras-to-find-a-minimum-spanning-tree
@@techdose4u Thanks! I see why it can not be used. MST path is not always guaranteed with Dijkstra.
Very well explained Thanks . Sir can you help me how to solve maths problem in competitive programming (to ace a job) and what number theory concept we should study ?
Thanks a lot for the crystal clear explanation!..Excited for the next on this series.
Welcome :)
Bhai you are the best. You explain everything in such a minimum amount of time. : )
Thanks
Thank you for all the work you are doing. Can't wait for prims and kruskal videos.
Thanks a lot for the very crystal clear explanation!
Welcome :)
Waiting for implementation of MST. Nice explanation
Thanks
Keep going , highly useful
really simple & clear explanation !!! keep posting more
Thanks
Excellent my friend!
Thank You
Thank you sir I'm a new subscriber
Thanks a ton Surya for this. 10:00 Shouldn't (A,B) -> 12 and (B,D) -> 7 though?
Thats what I notice as well
Awesome video with light Speed Outro.😍
Thanks
How will it impact if I tweak the question, say if the same path has been taken twice (assuming undirected graph) the cost of travel is zero. Kindly Include this also in your implementation.
Does MST algorithms are true for negative weight edges ?
You missed one thing, ie.. Number of Spanning Trees that can be generated from a given tree NumberOfSpanningTree= (EC|V-1| - number of cycles) where C represents Combinations like nCr
Is C= no. Of cycles?
@@avinashprasad4181 I have updated it,please check
What is EC can you clear it ?
Sir, In application (A,B) = 20 and (B,D) , I can't understand that, could you please tell me ?!
I dint get your question. Please mention timestamp as well.
@@techdose4u 10:20
Thank you!!
Welcome 😀
What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?
Thanks
Which software you are using sir?
Wacom pro inkspace
mast.❤️🔥
Thanks
@7:27 - Minimum Spanning Tree
can i get notes
First
Nice :)