Dijkstra
7:44
Added: 2 years ago
From: GreenfordMaths
Views: 18,937
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (20)

Sign In or Sign Up now to post a comment!
  • Greed is Good! one of the fundamental and simple algorithms

  • Greed is good!

  • the most difficult part of this algorithm is to spell its name correctly...

  • @master911cool Haha, not for me, I am Dutch :P It is an easy name for me to spell.

  • thanks! this was really helpful!

  • your method is floored and will not get you max marks in a decision maths exam .

  • @BTRMESSIAH your spelling is flawed

  • @tmosso1 listen to my advise this video will not get you all the marks in a d1 maths exam , and his method is shit.

  • most helpful, thanks mate!

  • just can't understand this fucking algorithm... :(

  • Just what I needed!

  • Thank u really much~! It s really helpful!

  • thanks

  • thanks, its perfect

  • I didnt quite get this, are we looking at the shortest roots from a to h? and when going back you said that we are taking the shortest roots, but A to B is shorter than a to d?

  • thank you soo much

  • You calculated the rute from D to E wrong, and didnt notice it when you when back - just saying.

    It's a very fine example thought and you took us through it very smoothly :)

  • thankyou

  • thanks

  • deeply appreciated. thx alot

  • cheers very useful

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more