Fundamentals of Computer Science II (CSC-152 99F)


Class 53: Graphs, Concluded

Back to Shortest Path. On to History of Computing (1).

Held Monday, December 6, 1999

Overview

Today, we consider a more efficient (but less intuitive) solution to the shortest path problem. This solution is known as Dijrkstra's method. It shares some ideas with Sierra's proposed solution.

Notes

Contents

Summary


Sierra's Shortest Path Strategy

Dijkstra's Shortest Path Algorithm

Dijkstra's Shortest Path Algorithm: An Example

Running Time

Other Graph Problems


History

Tuesday, 10 August 1999

Monday, 6 December 1999

Back to Shortest Path. On to History of Computing (1).


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/99F/Outlines/outline.53.html

Source text last modified Mon Dec 6 09:48:56 1999.

This page generated on Mon Dec 6 09:56:44 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu