[Discrete Mathematics] Dijkstra's Algorithm

[@adyanto4043]

Sometimes its frustating to see so less views on a quality video. TheTrevTutor you are great.

[@yhlin2807]

dijkstra's algorithm doesnt produce min spanning tree, Prim's does.

[@iffashafiqah8673]

u saved me from Final Exam because ur explanation is so clear and short.. easy to understand. Thanks :D

[@FlamingOven]

The first graph is the same from the assigned homework!

[@arminsmajlagic2907]

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.

[@mika5452]

I already took this final but I love how calming your voice is

[@hibouambigu2370]

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.

[@FadeStrategy]

You forgot a path value for the last example

[@ericlam4336]

You don't have a number for edge {E,D} I'm going to assume it doesn't exist.

[@souravmandal2376]

Don't you think a should be labled as (a,0) instead of (a,infinity)

[@terryrodgers9560]

so many videos describe this wong holy crap thanks for the correct explanation

[@rationalthinker9612]

Thank God..I have seen a few videos on this already and they totally sucked at explaining it...great job!!

[@moslehmahamud]

isn't djiktras a shortest path tree algorithm rather then a minimal spanning tree?

[@hchen31]

For your question, you did not give us the number between d and e? What should we do? Thanks!

[@wolfcompany2]

Please share the answer!! how am i suppose to know if i got it correct?

[@leozhang1340]

edge ED weight value??????

[@mandaparaeu]

What software are u using to explain?

[@PH03NXHDFYeah]

you should have more views

[@alidaoud8357]

Exactly !

[@darianharrison4836]

(if we assume that d,e is not connected) i show that a. goes to -->(f(h)) - (b(c,d)) and (e(g))

[@aidanmokalla7601]

This is what I got as well! 5 years later...

[@josemunguia5660]

GREAT VIDEO!

[@subratadutta7710]

What is the difference between Dijkstra's and Prim's algorithm. Every steps seems to be same 😥

[@bonkyyumena8582]

Many thanks

[@Mert-ed4xv]

I think the answer to your question is: infix of final tree=>cbdafheg can you share the answer?

[@BettyMoore-g5e]

视频非常好！ 我的OKX钱包里有USDT，并且我有恢复短语. 【pride】-【pole】-【obtain】-【together】-【second】-【when】-【future】-【mask】-【review】-【nature】-【potato】-【bulb】 我该如何将它们转移到Binance？

[@gizmo928]

what about prims algorithm

[@poopking8077]

Kruskal's and prim's algo are included in the syllabus now Trev, shits crazy

[@adriansomor]

@@poopking8077 where?

[@kaushikdr]

what if two paths have the same length? like hg and if in the 2nd to last step?

[@bipolarstrings]

you can pick either.. you can have multiple minimum spanning trees. The optimum solution would still be one.

[@loginid7108]

I really appreciate this lectures. But you could have shown a step-by-step written method along with this Algorithm. But thanks anyway

[@rimmisidhu8259]

is it true that a same graph G can be bipartite and make a hamilton circuit for km,n where m=n>=2 ?

[@datageek8324]

Too many ads 😡

[@ShushBush572]

💀