Fundamentals of Computer Science II (CSC-152 2000S)


Class 53: Shortest Path Problem

Back to Discussion of Exam 3. On to Graphs, Concluded.

Held Monday, May 8, 2000

Overview

Today we visit one of the more interesting graph algorithms, Dijkstra's shortest path algorithm.

Notes

Contents

Summary


Graph Problems, Revisited

Reachability Analysis

Shortest Path

Using The Breadth-First Connectivity Algorithm

A Brute-Force Shortest Path Algorithm

Dijkstra's Shortest Path Algorithm

Dijkstra's Shortest Path Algorithm: An Example


History

Tuesday, 18 January 2000

Monday, 8 May 2000

Tuesday, 9 May 2000

Back to Discussion of Exam 3. On to Graphs, Concluded.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/2000S/Outlines/outline.53.html

Source text last modified Tue May 9 09:14:07 2000.

This page generated on Tue May 9 09:53:56 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu