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


Class 52: Shortest Path

Back to Simple Graph Algorithms. On to Graphs, Concluded.

Held Friday, December 3, 1999

Overview

Today, we consider a variety of techniques for solving the shortest path problem, including an adapation of the breadth-first reachability solution and a brute-force method.

Notes

Contents

Summary


Connectivity, Revisited

Shortest Path

Using The Breadth-First Connectivity Algorithm

A Brute-Force Shortest Path Algorithm


History

Tuesday, 10 August 1999

Thursday, 2 December 1999

Monday, 6 December 1999

Back to Simple Graph Algorithms. 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/99F/Outlines/outline.52.html

Source text last modified Mon Dec 6 09:45:14 1999.

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

Contact our webmaster at rebelsky@grinnell.edu