CS 112 - Fall 2012, Lab 12

Haohan Zhu
CS 112 - Fall 2012, Lab 12 11/29/20

Graph
Boston University Slideshow Title Goes Here

 Vertices: V
 Edges: E

 Representation
 Adjacency list
 Adjacency matrix
 Adjacency sets

2
CS 112 - Fall 2012, Lab 12 11/29/20

Graph Traversal
Boston University Slideshow Title Goes Here

 Depth-first traversal
 Stack

 Breadth-first traversal
 Queue

3
CS 112 - Fall 2012, Lab 12 11/29/20

Graph Problem
Boston University Slideshow Title Goes Here

 Minimum Spanning Tree

 Prim's algorithm
 Kruskal's algorithm

 Shortest Path
 Dijkstra's algorithm
 Bellman–Ford algorithm

4
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here

∞ 9
B E
∞
3
2 6 4
7 12
∞ A C F ∞
∞
1 8
5 25
D G
20
∞ ∞
5
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9
B E
∞
3
2 6 4
0 7 12
A C F ∞
7
1 8
5 25
D G
20
5 ∞
6
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9
B E
∞
3
2 6 4
0 7 12
A C F ∞
7
1 8
5 25
D G
20
5 ∞
7
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 3+9=12
B E
3
2 6 4
0 7 12
A C F ∞
1 3+2=5 < 7 8
5 25
D G
20
5 ∞
8
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 12
B E
3
2 6 4
0 7 12
A C F ∞
1 5
8
5 25
D G
20
5 ∞
9
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 12
B E
3
2 6 4
0 7 12
A C F ∞
1 5
8
5 25
D G
20
5 ∞
10
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 12
B E
3
2 6 4
0 7 12
A C F ∞
1 5+1=6 > 5 8
5 25
D G
20
5 5+20=25

11
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 12
B E
3
2 6 4
0 7 12
A C F ∞
1 5
8
5 25
D G
20
5 25

12
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 12
B E
3
2 6 4
0 7 12
A C F ∞
1 5
8
5 25
D G
20
5 25

13
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 5+6=11 < 12
B E
3
2 6 4
0 7 12
A C F 5+12=17

1 5
8
5 25
D G
20
5 5+25=30 > 25

14
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 17

1 5
8
5 25
D G
20
5 25

15
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 17

1 5
8
5 25
D G
20
5 25

16
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 11+4=15 < 17

1 5
8
5 25
D G
20
5 25

17
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 25

18
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 25

19
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 15+8=23 < 25

20
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 23

21
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 23

22
CS 112 - Fall 2012, Lab 12 11/29/20

Dijkstra's algorithm
Boston University Slideshow Title Goes Here
3 9 11
B E
3
2 6 4
0 7 12
A C F 15

1 5
8
5 25
D G
20
5 23

23