March 8

Discuss midterm projects : what are you planning on doing? For Thu: progress reports & explain.

Today: continue discussion of graph algorithms as described last week and discussed in text.

1. breadth first vs depth first tree search : see attached example

2. binary heap in C : see my google code repo

3. Dijkstra's algorithm

wikipedia: Dijkstra's algorithm
(aside: Dijkstra quotes
What does it do? Describe the problem it solves.
How does it work? Write some pseudocode, using the binary heap
How fast does it run? Answer: typically O(|Edges| log(|Vertices|)). Under what assumptions? Explain.
What is the idea behind it? Answer: greedy. Explain.

4. Prim's algorithm

---

http://cs.marlboro.edu/ courses/ spring2011/algorithms/ notes/ March_8
last modified Tuesday March 8 2011 1:09 am EST

attachments

name last modified size