COSC 350: Data Structures
April 29, 2009

Graphs Algorithms

Unweight vs. weighted shortest path
Breath First Search (BFS)
Depth First Search (DFS)
Dijkstra's Algorithm
Spanning Trees and Prim's Algorithm

Homework

Friday, May 1:

1. Given a hash function f(x) = x % 10 and using linear probing, create a hash table where the data 60, 21, 41, 32, 87, 65, and 40 are entered in the order given.

2. For the graph,
a) give an adjacency matrix for the graph (ignoring weights)
b) give an adjacency list for the graph (ignoring weights)
c) use Dijkstra's algorithm to find the shortest path from A to G
d) give a spanning tree rooted at A using Prim's algorithm

Monday, May 4:

Test on Quicksort, Mergesort, Heaps & Heapsort, Binary Search Trees, Balancing Trees, Hashing, and Graphs & Graph Algorithms

Wednesday, May 6:

Class wrapup

This page was created by Joe Sloan.
It was last modified on or after: 1 May 2009
Send mail to: sloanjd@wofford.edu