dog agility dog tricks dog stunts dog bloopers frisbee dogs hurdle racing

Graphs: Dijkstra's Algorithm

Dog Agility Home
Dog Agility Home

Dog Agility Home
Dog Agility Home

How to find least-cost paths in a graph using Dijkstra's Algorithm. This video is distributed under the Creative Commons Attribution 2.5 Canada License. http://creativecommons.org/lic...

Channel: Education
Uploaded: November 30, 1999 at 12:00 am
Author: distanceedjohn

Length: 09:18
Rating: N/A
Views: 5652

Tags: computer  graphs  science  

Video Url:


Embed Code:

Video Comments

fyndor (November 30, 1999 at 12:00 am)
i don't see an arrow directly back from B to A. Can you really then say that the cost is 20 for B to A?
semifuntastik (November 30, 1999 at 12:00 am)
thank you very much amigo, your time and effort is greaty appreciated
pradeep617 (November 30, 1999 at 12:00 am)
Thanks for a very good explanation!!!
sapnacute16 (November 30, 1999 at 12:00 am)
nice explanation it realli help :) thnk u
campos1916 (November 30, 1999 at 12:00 am)
nice video. So this algorithm is similar to CPM/PERT methods in operations research. But in OR the "graphs" are continuos, i guess that this algorithm doesn't apply to general projects. Any help?
pranavtrehun007 (November 30, 1999 at 12:00 am)
Thanks for the gr8 explanation. it was very helpful.
Radexter (November 30, 1999 at 12:00 am)
great explanation! Thanks!
Muuip (November 30, 1999 at 12:00 am)
Great explanation! Thank you for posting.
XzAeRosho (November 30, 1999 at 12:00 am)
awesome video! Thanks!
shoaibi (November 30, 1999 at 12:00 am)
great explanation

Dog Agility Home © 2007 All Rights Reserved.