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


Class 53: Shortest Path, Revisited; Graphs, Concluded

Back to Reachability, Revisited; Shortest Path. On to History of Computing (1).

Held Monday, May 10

Summary

Contents


Handouts

Notes


Dijkstra's Shortest Path Algorithm

An Example

Running Time

Some Other Graph Algorithms

Traveling Salesperson Problem

Minimum Spanning Tree

Topological Sort


History


Back to Reachability, Revisited; 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/99S/Outlines/outline.53.html

Source text last modified Mon May 10 09:46:37 1999.

This page generated on Mon May 10 09:53:09 1999 by SiteWeaver. Validate this page's HTML.

Contact our webmaster at rebelsky@math.grin.edu