[Discrete Mathematics] Dijkstra's Algorithm 

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

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

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

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.

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.

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

The first graph is the same from the assigned homework!

For your question, you did not give us the number between d and e? What should we do? 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?

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

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

You forgot a path value for the last example

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

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

edge ED weight value??????

What software are u using to explain?

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

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 ?

you should have more views

Many thanks

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

what about prims algorithm

GREAT VIDEO!

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 😡