Efficient algorithms - Lecture 8

Topic: Graphs 2. Dijkstra's algorithm

Dijkstra's algorithm

Dijkstra's algorithm on wikipedia This class will discuss Dijkstra's algorithm for finding the shortest path in a graph.

Graph representations with weights on edges and vertices will also be discussed, including:

Edges list
Incidence matrix
Array of edges list
Double-array representation