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


Class 51: Simple Graph Algorithms

Back to Introduction to Graphs. On to Shortest Path.

Held Thursday, December 2, 1999

Overview

Today, we continue our consideration of the graph data structure by visiting some common graph problems.

Notes

Contents

Summary


Modeling with Graphs

Graph Problems

Traveling Salescritter Problem

Reachability Analysis


History

Tuesday, 10 August 1999

Wednesday, 1 December 1999

Thursday, 2 December 1999

Back to Introduction to Graphs. On to Shortest Path.


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.51.html

Source text last modified Thu Dec 2 20:35:16 1999.

This page generated on Thu Dec 2 21:07:26 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu