This is an archived course. A more recent version may be available at ocw.mit.edu.

Advanced Search
    Translations*

    Animations

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

    Breadth First Search (PDF) (PPT)
    Depth First Search (PDF) (PPT)
    Topological Sorting (PDF) (PPT)
    Flow Decomposition (PDF) (PPT)
    Dijkstra's Algorithm (PDF) (PPT)
    Dial's Algorithm (PDF) (PPT)
    Radix Heap Algorithm (PDF) (PPT)
    Label Correcting Algorithm (PDF) (PPT)
    Modified Label Correcting Algorithm (PDF) (PPT)
    Ford-Fulkerson Max Flow Algorithm (PDF) (PPT)
    Capacity Scaling Algorithm (PDF) (PPT)
    Shortest Augmenting Path Algorithm (PDF) (PPT)
    Preflow Push Algorithm (PDF) (PPT)
    Min Global Cut Algorithm (PDF) (PPT)
    Cycle Canceling Algorithm (PDF) (PPT)
    Successive Shortest Path Algorithm (PDF) (PPT)
    Network Simplex Algorithm (PDF) (PPT)
    Spanning Tree Algorithms (PDF) (PPT)