Algorithms

Spring 2013
course
navigation

Mar 7

aside

homework

Comments and grades have been posted for the midterm project. Generally nice work.

continue graphs

The start of next week's homework has been posted. I've set the due date for Fri before spring break.
I've done some cleaning up of the code we looked at last week, see prims algorithm. Discuss what I've put in, and perhaps talk about how to use the MinHeap I added to streamline the algorithm.
Look at Skienna slides 13 & 14 , and compare his C code with ours.
Discuss Dijkstra's algorithm, what it does, and how it compares with Prim's.

in class

We started to work on my cleaned up version of our previous Prim's code, to put in a MinHeap rather than an exhaustive search.
The prims2.py we began in class is attached.
Please read about Floyd's for next week.
http://cs.marlboro.edu/ courses/ spring2013/algorithms/ notes/ Mar_7
last modified Thursday March 7 2013 3:52 pm EST

attachments [paper clip]

     name last modified size
   prims2.py Mar 7 2013 3:16 pm 2.31kB