For Monday

1
For Monday

• Read chapter 9, section 4
• Homework
• Chapter 8, exercises 1-2

2
Program 3

• Any questions?

3
Paper 2

• Any questions?

4
Graph Representation

• Adjacency matrix
• Graph is represented using an 2-d array
• Indices of array represent nodes in the graph
• Cells of the matrix represent edges
• Adjacency lists

5
Graph Applications

• ???

6
Graph Applications

• Parallel computing
• Scheduling
• Games
• Problem solving
• Mapquest
• Networks (of wires, pipes, etc.)
• Knowledge representation

7
Topological Sorting
8
Shortest Path Problem

• Single source
• Two points
• All shortest paths

9
Unweighted Graphs

• Breadth-first search

10
Weighted Graphs

• Dykstras algorithm
• A greedy algorithm
• A form of best-first search

11
Negative Weights Problem