CMPE177: Applied Graph Theory and Algorithms

Martine Schlag, Fall 1998

Welcome to the evolving 177 Home Page

Send email to: your instructor, your TA, or to the entire class (including the instructor and TA).

Course Information

Homework Assignments

Project Description

Handouts

  1. The Matrix-Tree Theorem (postscript)
  2. Minimum Spanning Tree Algorithms (postscript)
  3. Breadth First Search(postscript)
  4. Dijkstra's Shortest Path Algorithm (postscript)
  5. Depth First Search(postscript)
  6. Cut Vertices and Biconnected Components (postscript)
  7. Finding Strongly Connected Components with DFS(postscript)
  8. Demoucron's Planarity Algorithm(postscript)

Other Information


The CMPE177 Web:
Copyright 1998; Department of Computer Engineering, University of California, Santa Cruz.

Portions of the CMPE177 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited.

Comments to: martine@cse.ucsc.edu (Last Update: 12/18/98 )