Monday

• Search Trees & Search Implementation
• Read Ch 26.3-26.5
• BFS simulator
• DFS simulator (recursive)

Tuesday

• Search related Algorithms
• Read Ch 26.6-26.7
• Topological sort simulator
• Connected components finder

Wednesday

Weighted Graphs and Shortest Paths

Read Ch 27.4-27.5

Djikstra's simulator

Prim MST simulator

Prim's practice Trackla.jar, Content->Graph Algorithms->Prim. No table or queue provided, makes clear why some structure is needed for efficient processing.

Dijkstra's practice Trackla.jar, Content->Graph Algorithms->Djikstra with Heap. Heap provided to use as priority queue. Use update button to modify cost of vertex already in queue

Dijkstra's practice Trackla.jar, Content->Graph Algorithms->Djikstra. Same but with queue provided, makes clear why some structure is needed for efficient processing

Friday

• No class