Mar 14

aside

Last day looking at graph algorithms.

Your choice between :

Discuss your code - the "implement one" assignment due today.
Implement Floyd's in class, starting from scratch. (And really have it be you this time.)
Walk through examples of other graph problems from Skienna's book and/or website
- chap 15: polynomial time graph problems
- chap 16: hard graph problems
  - http://en.wikipedia.org/wiki/Travelling_salesman_problem
- online summaries and code links at http://www.cs.sunysb.edu/~algorith/
- http://en.wikipedia.org/wiki/List_of_algorithms
- http://en.wikipedia.org/wiki/Category:Graph_algorithms

Some old TSP code of mine and an SVG plotting library is in TSP

We wrote a short implementation of Floyd's in class, see attached.

http://cs.marlboro.edu/ courses/ spring2013/algorithms/ notes/ Mar_14
last modified Thursday March 14 2013 2:36 pm EDT

name last modified size