Engineering Notes
Created by admin on Thu, 17/05/2012 - 16:34
Sub Topic:
Dijkstra's Shortest Path Algorithm
Upload File:
Department:
Chapter Name:
GraphTheory
Description:
In recitation we talked a bit about graphs: how to represent them and how to traverse them. Today we will discuss one of the most important graph algorithms: Dijkstra's shortest path algorithm, a greedy algorithm that efficiently finds shortest paths in a graph. (Pronunciation: "Dijkstra" is Dutch and starts out like "dike").
Add new comment