ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
Sometimes its frustating to see so less views on a quality video.TheTrevTutor you are great.
u saved me from Final Exam because ur explanation is so clear and short.. easy to understand. Thanks :D
I already took this final but I love how calming your voice is
dijkstra's algorithm doesnt produce min spanning tree, Prim's does.
Thanks. This explanation stuck! I like this method a bit more than the method with the table on the side of the graph. It's a bit more visual this way.
The first graph is the same from the assigned homework!
It would be great if you add Kruskal, BFS, DFS...given how common they are in abstract math and how well u teach.Still big thanks.
so many videos describe this wong holy crap thanks for the correct explanation
Thank God..I have seen a few videos on this already and they totally sucked at explaining it...great job!!
isn't djiktras a shortest path tree algorithm rather then a minimal spanning tree?
edge ED weight value??????
Don't you think a should be labled as (a,0) instead of (a,infinity)
You don't have a number for edge {E,D} I'm going to assume it doesn't exist.
For your question, you did not give us the number between d and e? What should we do? Thanks!
(if we assume that d,e is not connected) i show that a. goes to -->(f(h)) - (b(c,d)) and (e(g))
This is what I got as well! 5 years later...
You forgot a path value for the last example
Please share the answer!! how am i suppose to know if i got it correct?
What software are u using to explain?
you should have more views
Exactly !
what about prims algorithm
Kruskal's and prim's algo are included in the syllabus now Trev, shits crazy
@@poopking8077 where?
what if two paths have the same length? like hg and if in the 2nd to last step?
you can pick either.. you can have multiple minimum spanning trees. The optimum solution would still be one.
视频非常好！ 我的OKX钱包里有USDT，并且我有恢复短语. 【pride】-【pole】-【obtain】-【together】-【second】-【when】-【future】-【mask】-【review】-【nature】-【potato】-【bulb】 我该如何将它们转移到Binance？
I think the answer to your question is: infix of final tree=>cbdafheg can you share the answer?
Many thanks
GREAT VIDEO!
What is the difference between Dijkstra's and Prim's algorithm. Every steps seems to be same 😥
is it true that a same graph G can be bipartite and make a hamilton circuit for km,n where m=n>=2 ?
I really appreciate this lectures. But you could have shown a step-by-step written method along with this Algorithm. But thanks anyway
Too many ads 😡
💀
![[Discrete Mathematics] Flow Networks and the Edmonds Karp Algorithm](http://i.ytimg.com/vi/JNA5frxZHLs/mqdefault.jpg)
![[Discrete Mathematics] Flow Networks and the Edmonds Karp Algorithm](/img/tr.png)
Sometimes its frustating to see so less views on a quality video.
TheTrevTutor you are great.
u saved me from Final Exam because ur explanation is so clear and short.. easy to understand. Thanks :D
I already took this final but I love how calming your voice is
dijkstra's algorithm doesnt produce min spanning tree, Prim's does.
Thanks. This explanation stuck! I like this method a bit more than the method with the table on the side of the graph. It's a bit more visual this way.
The first graph is the same from the assigned homework!
It would be great if you add Kruskal, BFS, DFS...given how common they are in abstract math and how well u teach.
Still big thanks.
so many videos describe this wong holy crap thanks for the correct explanation
Thank God..I have seen a few videos on this already and they totally sucked at explaining it...great job!!
isn't djiktras a shortest path tree algorithm rather then a minimal spanning tree?
edge ED weight value??????
Don't you think a should be labled as (a,0) instead of (a,infinity)
You don't have a number for edge {E,D} I'm going to assume it doesn't exist.
For your question, you did not give us the number between d and e? What should we do? Thanks!
(if we assume that d,e is not connected) i show that a. goes to -->(f(h)) - (b(c,d)) and (e(g))
This is what I got as well! 5 years later...
You forgot a path value for the last example
Please share the answer!! how am i suppose to know if i got it correct?
What software are u using to explain?
you should have more views
Exactly !
what about prims algorithm
Kruskal's and prim's algo are included in the syllabus now Trev, shits crazy
@@poopking8077 where?
what if two paths have the same length? like hg and if in the 2nd to last step?
you can pick either.. you can have multiple minimum spanning trees. The optimum solution would still be one.
视频非常好！ 我的OKX钱包里有USDT，并且我有恢复短语. 【pride】-【pole】-【obtain】-【together】-【second】-【when】-【future】-【mask】-【review】-【nature】-【potato】-【bulb】 我该如何将它们转移到Binance？
I think the answer to your question is: infix of final tree=>cbdafheg
can you share the answer?
Many thanks
GREAT VIDEO!
What is the difference between Dijkstra's and Prim's algorithm. Every steps seems to be same 😥
is it true that a same graph G can be bipartite and make a hamilton circuit for km,n where m=n>=2 ?
I really appreciate this lectures. But you could have shown a step-by-step written method along with this Algorithm. But thanks anyway
Too many ads 😡
💀