Animations

Animations are available to illustrate and clarify many of the topics covered in the lecture notes for this course. We recommend you view the Microsoft® PowerPoint® (PPT) versions, if possible, because they include motion.

SES # TOPICS PDFS SLIDES
3

Breadth first search

Depth first search

Topological ordering

(PDF)

(PDF)

(PDF)

(PPT - 1.3MB)

(PPT - 2.1MB)

(PPT)

4

Eulerian cycles in directed graphs

Flow decomposition

(PDF)

(PDF)

(PPT)

(PPT)

5 Dijkstra's algorithm (PDF) (PPT)
6

Dial's algorithm

2-level bucket algorithm

Radix heap animation

(PDF)

(PDF)

(PDF)

(PPT)

(PPT - 1.6MB)

(PPT)

7

Label correcting algorithm

Modified label correcting algorithm

(PDF)

(PDF)

(PPT)

(PPT)

9 Ford-Fulkerson algorithm (PDF) (PPT)
11 Preflow push algorithm (PDF) (PPT - 1.1MB)
13 Negative cycle (cycle canceling) algorithm (PDF) (PPT)
14 Successive shortest path (SSP) algorithm (PDF) (PPT)
16 Network simplex animations (PDF) (PPT - 1.1MB)