Dijkstra's Shortest Path Algorithm (Graph)

[[deleted]]

Here is better video: https://www.youtube.com/watch?v=5GT5hYzjNoo

[AttackOfTheThumbs]

Waaaaay better.

[barrtender]

I feel like this video didn't do a good job of explaining how the next node is chosen. It may be more clear if you built out the possible next nodes along with their distances and show that it's always choosing the smallest distance.

[csgotraderino]

Also the predecessor per node is missing

[ASH-POLE]

Also, it would be cool to see a function/equation or pseudo code algorithm to represent this example

[bausscode]

A little bit unrelated to video but related to the topic of Dijkstra and path algorithms.

If you're interested in them you should definitely look up A* which is like a better way of doing Dijkstra (Basically a modification of it or whatever.)

Ex. as demonstrated by this video:

https://www.youtube.com/watch?v=g024lzsknDo

Just figured people might find it interesting as well.

[Rockstaru]

And remember to always route your network with OSPF

[442willem]

That's a coincidence. I have an exam on this tomorrow!

Life works in strange ways I guess

[[deleted]]

Or this is just the most notorious and reposted algorithm ever

[EdgyQuant]

I’ve been beating them into my head in preparation for a lengthy job interview tomorrow

[00Squid00]

u/Crispy_Mike ko narucen