Studying for my data structures exam that is in... four hours. Your videos on Kruskals, Prims, and Dijkstra's are saving my life because I missed those lectures. Cheers mate!
@monaami5557 жыл бұрын
"the main thing is, you can't have any psychos" - agree!
@hdjksa527 жыл бұрын
LOL........ I am latin and members of my family speak with an accent.
@user-rf4vc7mt4d3 жыл бұрын
SCAM
@amrahmed78564 ай бұрын
He means *_cycles_*
@Alkis053 жыл бұрын
One improvement I would make would be this: When choosing between two edges with the same weight, choose randomly between them, but give a probability weighted by the degree of the node you are connecting to. In many real life networks, nodes with high degree tend to receive more new nodes than less connected nodes.
@dedel08104 жыл бұрын
I thought it was my laptop's fan that sounds so loud when i listened to the audio. I panicked for a sec. But thanks! This really helped a lot!
@MuhidAbid14point753 жыл бұрын
Again, short and simple to the point great video.
@jacopomaccari40864 жыл бұрын
bro just increase the thickness of the pen 😂😂
@EducateYourselfNow4 жыл бұрын
very good point
@anoriginalnick3 жыл бұрын
He did but the brush size stays the same 😭
@tamersahin51894 жыл бұрын
THIS VIDEO IS JUST 🔥🔥🔥🔥 THX A LOT MAN!!!!!
@gongjiaji24896 жыл бұрын
thank you very much, i have exam tomorrow
@EducateYourselfNow6 жыл бұрын
good luck!
@christoforoslapathiotis80643 жыл бұрын
so how did it go?
@sakethcherukuri2773 жыл бұрын
@@christoforoslapathiotis8064 some of lifes greatest mysteries. we may never know!
@097_zarb24 ай бұрын
Pretty good@@christoforoslapathiotis8064
@sirch19847 жыл бұрын
Thanks for helping me with my hw, you rock my dude
@EducateYourselfNow7 жыл бұрын
I am glad I can help
@JoseSanchez-vv1zd6 жыл бұрын
Nice explanation. Thank you.
@iffatsarfraz51456 жыл бұрын
I agree. Thank you so much for posting this video!
@orangutan796 жыл бұрын
if you also circle the vertices you've visited red, choosing the next edge/vertex pair will become easier without having to look through the entire graph to check for a cycle
@EducateYourselfNow6 жыл бұрын
that is true, didn't think of that, thank you. i ll incorporate that in my upcoming videos
@ZapOKill2 жыл бұрын
thats not correct. 3:00 would fail. you have to maintain a en.wikipedia.org/wiki/Disjoint-set_data_structure
@unknownplayer03834 жыл бұрын
dope !!!!! thanks for this video. you just did 10 times better than my professor at cal state Monterey Bay
@andreicusnir43207 жыл бұрын
very nice explained video! Thank you
@EducateYourselfNow7 жыл бұрын
Thank you Andrei :)
@xxakhilh47xx413 ай бұрын
Lifesaver
@wachowski95252 жыл бұрын
what a king, ty
@nashb96917 жыл бұрын
Dude i love you man
@EducateYourselfNow7 жыл бұрын
thank you brother, i appreciate the love :)
@JC-cu2ym4 жыл бұрын
THANKS FOR SAVING MY LIFE :D !!!!
@amiraayedi4 ай бұрын
Thank you for this!! (you have a nice voice though god)
@sanjeewankulathunga5 жыл бұрын
i have exam tomorrow thanks man i got it
@EducateYourselfNow5 жыл бұрын
i hope you did well :)
@nooranalkhateeb8481 Жыл бұрын
the path you choose is not the shortest path
@sanket_valani5 жыл бұрын
Nice work man :)
@EducateYourselfNow5 жыл бұрын
thank you :)
@zepheriah52946 жыл бұрын
You said that since you decided to pick the edge with amount 8 from B - C, you couldn't pick the edge amount with 8 also from A - H because it wasn't a part of the same tree. Why is that? I thought all of the vertices were in one tree? What is the criteria on that?
@EducateYourselfNow5 жыл бұрын
The reason why we can't choose a-h after choosing b-c is because it would form a cycle. Yet if we have chosen a-h instead of b-c, we would have a different resulting MST. You can have multiple MST from a single graph.
@zepheriah52945 жыл бұрын
@@EducateYourselfNow Duh! Thank you!
@tanss6467 Жыл бұрын
Good video, help me a lot
@sirisunkam60116 жыл бұрын
U r explanation too gud...pls explain bellmanford algorithm also....
@EducateYourselfNow6 жыл бұрын
i will upload it soon
@eyyys13424 жыл бұрын
THANK U SO MUCH FOR THIS
@bennybob4446 жыл бұрын
Given completely distinct edges in graph G, there is only a single MST.
@badboybs982 жыл бұрын
Given a graph G lets prove this by contradiction: G has two MST A,B. A has an edge e that B does not If we add that edge to B then there is a cycle. However, k. Algo would have picked the edge e0 over e therefore, A must not be in mst.
@mikewong58595 жыл бұрын
Pretty nice, thanks.
@EducateYourselfNow5 жыл бұрын
thank you :)
@norueljayvillas57805 жыл бұрын
so it means that the objective of this algorithm is to find the lowest edge-weights? and then it should start also in the lowest number of weights? thanks sir, btw you did a great job, i',m just a little bit confused because i don't know the rules of this algorithm.
@EducateYourselfNow5 жыл бұрын
well to find the minimum cost edges, which would eventually result mst. its a greedy algorithm, it doesn't necessarily start at the lowest number of weights but it will find them. and thank you sir
@Poojasahani123564 жыл бұрын
Awesome sir😍😍
@ifzahmed39737 жыл бұрын
Thanks bro
@monilparekh39725 жыл бұрын
1. how does adding edge (b,h) with edge weight 11 form a cycle? 2. adding (c,i) and (g,f) with edge weight 2 is fine but adding (b,c) and (a,h) with edge weight 8 is a problem. can you elaborate?
@Koo998_5 жыл бұрын
1. with (b,h), it will loop the diagram. This means you will be creating a cycle where it goes from b, h, g, f, c, b. You do not want the arc/edge to be in a cycle (loop). Not connecting (b,h) means that there is no loop created. 2. Adding (c,i) and (g,f) is fine because they will not create a cycle, so you pick both. (b,c) and (a,h) is only a problem because you can not pick both as that will create a loop/cycle. But he states that you can pick either one as either (b,c) or (a,h) as there will sometimes be multiple minimum spanning trees (alternative paths).
@ahmedmagdy-qg3tb5 жыл бұрын
good job
@EducateYourselfNow5 жыл бұрын
thank you!
@jahanzaibasgher12756 жыл бұрын
thank you
@mojtabavatandost39825 жыл бұрын
thanks
@simonhrabec99734 жыл бұрын
Ok, how do we get the lowest weighted edges? How do we find if adding an edge would form a cycle? Isnt explaining this the point of these videos?
@mahdiebrahimi16624 жыл бұрын
Thank you so much! XD
@HauNguyen-mb3si6 жыл бұрын
Thanks
@WoosTV6 жыл бұрын
thx bro
@prvizpirizaditweb2324 Жыл бұрын
why did not you choose both edges with weight 8?
@cutething49105 жыл бұрын
Thank u sir
@Github_tech_with_ty4 жыл бұрын
Can someone explain what he mains by cycle more?
@caparn1004 жыл бұрын
How do you programmatically test if adding the edge will form a cycle?
@aurbakhan10197 жыл бұрын
can anyone explain why did not we consider the other 8
@EducateYourselfNow7 жыл бұрын
we could, it wouldn't have mattered. I think i mentioned it in the video. 3:07
@MsKevkev12347 жыл бұрын
if he did it would form a loop abcfgha
@cameronfitzpatrick24896 жыл бұрын
either way forms a mst - mst is not necessarily unique
@samailotoke72012 жыл бұрын
Is this the same as minimum cost arborescence?
@halcy64224 жыл бұрын
well you could remove the c-d, and replace it with e-f. i think it will produce better MST
@sky765705 жыл бұрын
In the Time Complexity part, you definitely gave a description of the runtime of the Prim's algorithm, not Kruskal's.
@i0dan3 жыл бұрын
BIG O!
@mohdalnokhatha5215 жыл бұрын
thanks a lot man its very helpful answer is 42 ??
@marieselfer66214 жыл бұрын
Isn't it 37?
@tiberiunaznean71554 жыл бұрын
@@marieselfer6621 i think its 37 too
@BradleyLillian-n9h19 күн бұрын
Hannah Lodge
@Turkeys_VR6 жыл бұрын
It looks like C would form a cycle. Am I missing something?
@EducateYourselfNow6 жыл бұрын
there is no loop that encloses c
@ffs04 жыл бұрын
Dikjstra algo??
@azzahrahumaira69555 жыл бұрын
if we have touched all the vertices but not all the edges yet what should i do? finish all the edges?
@EducateYourselfNow5 жыл бұрын
yes
@Chandler8907 жыл бұрын
so whats difference btw prims
@EducateYourselfNow7 жыл бұрын
at a very high level, prims algorithms graph has to be connected, kruskals doesn't, in kruskals, you look at the next globally least costly edge where in prims you look at all edges from the current component to other vertices and find the smallest among them.
@dabluedevil10006 жыл бұрын
How would choosing the edges "bh" create a cycle?
@EducateYourselfNow6 жыл бұрын
cycle would be : b c f g h, or b h g f c
@aldrinebarit39613 жыл бұрын
how do you get those numbers?
@TheBobby5707 жыл бұрын
EE241C5A ftw!!!
@muhammadazfar973 жыл бұрын
Can't understand about algorithm
@almuntasirabir45117 жыл бұрын
why did you choose both the two
@EducateYourselfNow7 жыл бұрын
because the next two was the lowest costly edge, it doesn't matter how many of the same numbers you have, as long as it doesn't create a cycle, you can choose it.
@almuntasirabir45117 жыл бұрын
thanks
@niklaspeura41936 жыл бұрын
But is it still minimal is the question.
@kma11386 жыл бұрын
@xiangzuo13066 жыл бұрын
u such a copy ninja (from book introduction of algorithm)