CSC-152 2000S : Class 52: Discussion of Exam 3

Held Friday, May 5, 2000

Overview

Today we planned to discuss the shortest path problem, but ended up going over the exam.

Notes

You can find the ``final'' version of code (when I receive it) at http://www.cs.grinnell.edu/~rebelsky/CS152/Project/Final/

Are there questions on exam 3?

Reminder: There was an additional question for you to think about for today: How might we find the shortest path between two nodes in a weighted, directed, graph?

The Math/CS picnic is next Friday, May 12, at 5pm. You are all invited. Please sign on the signup sheet today.

I'll try to hand out the final exam on Monday.

Contents

Summary

Shortest path: How fast can you get there from here?

A brute-force shortest-path algorithm

Dijkstra's algorithm

Design issues in graph problems

Minimum spanning tree

Handouts:

Final examination

Due:

Exam 3

History

Tuesday, 18 January 2000

Created as a blank outline.

Friday, 5 May 2000

Filled in the details, many of which are taken from outline 51, outline 52, and outline 53 of CSC152 99F

Back to Introduction Graphs. On to Shortest Path Problem.

[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Project] [Outlines] [Labs] [Assignments] [Quizzes] [Exams] [Examples] [EIJ] [JPDS] [Tutorial] [API]

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/2000S/Outlines/outline.52.html

Source text last modified Mon May 8 09:56:01 2000.

This page generated on Mon May 8 10:00:33 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu