At 5:45 , you ticked BD instead of CD Suggestion:- I found it better in earlier few of your vids where you wrote pseudo code on board(ie explain each line as you go along) instead of this method Thanx for the vid
I really LOVE your way of teaching, to the point and so easy to understand. You have inspired me to start my own TH-cam channel. I would really love some feedback/support, so please have a look and check it out.
Been struggling trying to understand this for a while. You made quite simple and easy to understand. I also love how you added the code at the end, so we could get a look at how it would actually be implemented. Love it! Thanks man.
Good quality videos and explanations, but your playlist is a little out of order. start at the beginning and every video you mention the need for watching a different one in this playlist first that seems to be ordered randomly. its fine and all lol, i just wish i knew where to start without having to find the shortest path through your playlist :P thanks for the videos
Hi Tushar , when i landed to your channel and watched few videos , trust i stayed here for ever. Your source code repository is also a bonus. You must charge now ;)
bro how are you representing the graph.. do u have a package called Graph so that u can use Graph,Edge etc... ? i cant find them .. i mean i wrote the whole code nd im unable to figure out what should be the arguments in the classes GRAPH and EDGE which matches the arguments in "findSet and Union" in your "Disjoint set"
In the code, you can break the 'for loop' when Disjoint Set size becomes (v-1) where 'v' is number of vertices because number of edges in MST would always be (v-1).
Wow, Really it saved 4 hrs of reading a DS and Algo text book. Thank u very much. And a small request is please speak little slow(speed). Thanks again for great video..
+rubidium yeah, you can. add a loop which will observe/count of edges getting added in your final result set. the termination condition would be : (the count of edges) should not exceed (number of vertices - 1 ). Thanks to Tushar for this video
Yes you can but it adds additional time complexity to check at every turn if all the vertices have been added. Therefore it is better to just go through the whole thing in one go.
sir you are really great in explaining these videos can you please put up a video on fractional knapsack and task scheduling program you sir helped me alot in my first sessionals in ada.
Yup, you are right. It is not minimum optimal path algorithm. It is minimum spanning tree. Now the problem it solves is that it gives you minimum cost of building a network. For example, you need to lay underground pipes connecting each house of a locality with a condition that it should be possible to go to any location x to any location y but you have limited resources (here, pipes). So you become greedy and wise in spending the resources. That is where you can directly apply the algorithm discussed above. After that you would have connected each house with each other without wasting any resource.
Oh! I see the implementation of EdgeComparator in your source code which implements Comparator. Thanks for the awesome videos! Can you please make videos of String, Arrays & Matrix topics? Or Can you give me good source where there are lot of above topics questions and its explanation? It makes easy and interesting to learn when someone(like you) explains the problem. :)
We store the edges in a sorted array, so that is O(E). We also make a total of V sets for the vertices, so that is O(V). So the space complexity is O(E+V)
At 5:45 , you ticked BD instead of CD
Suggestion:- I found it better in earlier few of your vids where you wrote pseudo code on board(ie explain each line as you go along) instead of this method
Thanx for the vid
yeah that was better
explaination with pseudocode
but anyways thanks sir
yeahhhh .. i feel the sameee
You made all the graph algorithms look so easy with your tutorials. I enjoy your videos. Keep them coming !!!!
I really LOVE your way of teaching, to the point and so easy to understand. You have inspired me to start my own TH-cam channel. I would really love some feedback/support, so please have a look and check it out.
Why I'm so late here??? Wish I were early here so I would be working in a better firm right now! 😐
It's CD and not BD at 5:44
Thank you brother we passed our exams because of your videos without your clips we are getting big trouble brother....thank you very much..
one mistake..BD is not finally result...pl rechange BD into CD
ya the answer should be 9 not 11
Really very helpful. Good job sir....Thanx a lot!!
Thank you so much! Your explanation is very clear ^^
Been struggling trying to understand this for a while. You made quite simple and easy to understand. I also love how you added the code at the end, so we could get a look at how it would actually be implemented. Love it! Thanks man.
Actually in this video u ignored the edge BD but in last u ticked why is this so?
I always click your video first when I search an algorithm in TH-cam. Thanks!
I'm not good in algorithm, I'm not so good in english but you make it so simple that also me understood xD
Good quality videos and explanations, but your playlist is a little out of order. start at the beginning and every video you mention the need for watching a different one in this playlist first that seems to be ordered randomly. its fine and all lol, i just wish i knew where to start without having to find the shortest path through your playlist :P thanks for the videos
Hi Tushar , when i landed to your channel and watched few videos , trust i stayed here for ever. Your source code repository is also a bonus. You must charge now ;)
Please mention the pseudo codes in your videos aswell. Thanks
It would be helpful if you could add the link to the video for disjoint sets here. Other than that good job..love ur videos.
plzz give code of beginners level, dont use inbuilt methods
for(true){
"thank you" ;
}
which algorithm is better:- prims or Kruskal
y r we using disjoint set is because we dont want cycles
great class Sir..!....Thank u so much.
bro how are you representing the graph.. do u have a package called Graph so that u can use Graph,Edge etc... ?
i cant find them .. i mean i wrote the whole code nd im unable to figure out what should be the arguments in the classes GRAPH and EDGE which matches the arguments in "findSet and Union" in your "Disjoint set"
hi,
can you give me c code in kruskal?
In the code, you can break the 'for loop' when Disjoint Set size becomes (v-1) where 'v' is number of vertices because number of edges in MST would always be (v-1).
*Answer for the above graph if done manually 9 units. Hit like or comment if anybody done*
Wow, Really it saved 4 hrs of reading a DS and Algo text book. Thank u very much.
And a small request is please speak little slow(speed). Thanks again for great video..
Thanx a ton, would be much better if you explained Pseudo code instead of actual code! other than that great work
An excellent video. I do appreciate.
Can you please provide a lecture on Random Walk for a Weighted Graph ?
Is this a union by size or union by height?
Can't we stop stop the algorithm once we get all the nodes in one set? Why do we need to check for CE and DE?
+rubidium yeah, you can. add a loop which will observe/count of edges getting added in your final result set. the termination condition would be : (the count of edges) should not exceed (number of vertices - 1 ).
Thanks to Tushar for this video
Yes you can but it adds additional time complexity to check at every turn if all the vertices have been added. Therefore it is better to just go through the whole thing in one go.
Navneet Jain The termination condition can be "len(resultEdge) >= numOfVertex -1". Should not add time complexity
Very Nice Tuts and awesome for learning each topic in depth. Can we stop the edges iteration when disjoint set size equals to Vertices count in Graph?
sir you are really great in explaining these videos
can you please put up a video on fractional knapsack and task scheduling program
you sir helped me alot in my first sessionals in ada.
what about algorithm for Minimum Spanning tree from a undirected and unweighted graph??
Please have a tutorial on Breadth first search and depth first search,overall your tutorials are great :)
For your next video, can you explain dijkstras algorithm?
How we sort edge in non decreasing order
How do I get a path between 2 nodes (along this MST) assuming I have the result set of edges?
In your Dijkstra video, it was clear.
your videos are really helpfull
we can stop processing edges once the result set has (|V| -1 ) edges. this will save some time.
If the edges are already sorted then the time complexity comes down to O(n) right?
Gautam gambhir's double
Really appreciated Tushar to make it simple for us to understand algorithms.
At 5:44 the edge should be C-D with cost 1 instead of B-C with cost 3.
Thanks very much man
Complete code: goo.gl/8TMkTt
Good work Tushar. Thank you.
I know in some videos you use colored markers, I think it makes it easier to follow
Hi, my friend, you don't need to erase the nodes and rewrite them again and again. That makes me feel uncomfortable!
Thank you, Tushar! This video was helpful for my understanding
explain the time complexities instead of just stating it
0 to 0.20 like Tushar was an adrenaline rush !!
Great video. Is there a video for Arborescence?
Thank you so much , your tutorial are so easy
please provide c++ implementation ....
again, you are the best. i have a basic question. i don't understand what problem this algo is trying to solve. it is not minimum optimal path algo.
Yup, you are right. It is not minimum optimal path algorithm. It is minimum spanning tree. Now the problem it solves is that it gives you minimum cost of building a network. For example, you need to lay underground pipes connecting each house of a locality with a condition that it should be possible to go to any location x to any location y but you have limited resources (here, pipes). So you become greedy and wise in spending the resources. That is where you can directly apply the algorithm discussed above. After that you would have connected each house with each other without wasting any resource.
In your github repo, you have mentioned the time complexity as 0(ElogE) in place of O(ElogE + E)
O(n^2+n) = o(n^2) as n^2>n . here in this case nlogn>n. so o(nlogn+n)=o(nlogn)
You get confused in this video :p
You are great..! helped me alot..!
thanks a lot , it was helpful video
good lecture on graphs and trees
good lecture on graphs and trees
Amazing video sir. Thank You.
Very well explained thanks a lot!!
Clearly Explained, Thanks.
East or west tushar sir is the best
Can you please explain what is edgeComparator here?
Oh! I see the implementation of EdgeComparator in your source code which implements Comparator.
Thanks for the awesome videos! Can you please make videos of String, Arrays & Matrix topics? Or Can you give me good source where there are lot of above topics questions and its explanation? It makes easy and interesting to learn when someone(like you) explains the problem. :)
Very good
Very good explanation
it was really nice thanks
god of ds
i din understand how to calculate space complexity
We store the edges in a sorted array, so that is O(E). We also make a total of V sets for the vertices, so that is O(V). So the space complexity is O(E+V)
thats all? o.O that easy?
good
bhai.. thanks a lot!
Why do we sort the edges? how does that help in the execution?
We need the minimum weight for our spanning tree. so we started with least weight edge. Hope this clears your doubt.
nice explanation sir
No offense, you speak very fast!
+Paul Crozier u tube provides u wid the facility to slow ur video ,,, and i watched it at 2X
same
good video, but please talk more quietly
cant you just reduce the volume :P ?
At 5:45 it is cd not bd
thank you teacher!
Well explaned :)
Great Video
cant see the board bcz of subtitles
please unmark cc button...
sir bd path is not present in answer ... it should be cd
Satisified 😊
You're a legend.
شرح رائع شكرًا
the best!
Good one.
that was amazing
তীরে এসে তরী ডুবিয়ে দিলো।😂😂😂😂😂উত্তর 4+2+1+1+1=9 হবে।।
sir speed is very fast
Whoa!!! What was the beginning like??? You seemed more like a robot with zero expression...
bekaaarrr .......vdo
Sir, why is it phut and not put..please it irritates..
chuss video
Bhai ye tw jyada he angrez banra😂