Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Undirected Depth First Search Adjacency Lists A: F C B G B: A C: A D: F E E: G F D F: A E D: G: E A: H: I: I: H: F A BCG DE HI.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1 Undirected Depth First Search Adjacency Lists A: F C B G B: A C: A D: F E E: G F D F: A E D: G: E A: H: I: I: H: F A BCG DE HI."— Presentation transcript:

1

2 1 Undirected Depth First Search Adjacency Lists A: F C B G B: A C: A D: F E E: G F D F: A E D: G: E A: H: I: I: H: F A BCG DE HI

3 2 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack F newly discovered

4 3 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) A already marked

5 4 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) E newly discovered E

6 5 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) G newly discovered G

7 6 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(G) (G, E) (G, A) E already marked

8 7 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(G) (G, E) (G, A) A already marked

9 8 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(G) (G, E) (G, A) Finished G

10 9 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) F already marked

11 10 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) D newly discovered D

12 11 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(D) (D, F) (D, E) F already marked

13 12 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(D) (D, F) (D, E) E already marked

14 13 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) visit(D) (D, F) (D, E) Finished D

15 14 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) visit(E) (E, G) (E, F) (E, D) Finished E

16 15 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) D already marked

17 16 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(F) (F, A) (F, E) (F, D) Finished F

18 17 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack C newly discovered C

19 18 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(C) (C, A) A already marked

20 19 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(C) (C, A) Finished C

21 20 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack B newly discovered B

22 21 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(B) (B, A) A already marked

23 22 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(B) (B, A) Finished B

24 23 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack G already finished

25 24 visit(A) (A, F) (A, C) (A, B) (A, G) Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack Finished A

26 25 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack

27 26 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(H) (H, I) I newly discovered I

28 27 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(H) (H, I) visit(I) (I, H) H already marked

29 28 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(H) (H, I) visit(I) (I, H) Finished I

30 29 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack visit(H) (H, I) Finished H

31 30 Undirected Depth First Search F A BCG DE H Undiscovered Marked Finished Active I Stack

Download ppt "1 Undirected Depth First Search Adjacency Lists A: F C B G B: A C: A D: F E E: G F D F: A E D: G: E A: H: I: I: H: F A BCG DE HI."

Similar presentations

1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)

1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
1 Breadth First Search s 2 5 4 7 8 369. 2 s 2 5 4 7 8 369 0 Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.

1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Breadth First Search AB F I EH DC G FIFO Queue - front.

Breadth First Search AB F I EH DC G FIFO Queue - front.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.

1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
1 Depth First Search 0 1 2 3 4 dfs(0, 0) 01234 open site blocked site reachable from top via open sites.

1 Depth First Search dfs(0, 0) open site blocked site reachable from top via open sites.
Graphs – Depth First Search ORD DFW SFO LAX 802 1743 1843 1233 337.

Graphs – Depth First Search ORD DFW SFO LAX
Breadth-First Search Text Read Weiss, § 9.3 (pp. 299-304) Breadth-First Search Algorithms.

Breadth-First Search Text Read Weiss, § 9.3 (pp ) Breadth-First Search Algorithms.
Graphs II Kruse and Ryba Chapter 12. Undirected Graph Example: Subway Map.

Graphs II Kruse and Ryba Chapter 12. Undirected Graph Example: Subway Map.
Algorithms and Data Structures

Algorithms and Data Structures
1 Undirected Breadth First Search F A BCG DE H Source:

1 Undirected Breadth First Search F A BCG DE H Source:
Graphs. Data structures that connect a set of objects to form a kind of a network Objects are called “Nodes” or “Vertices” Connections are called “Edges”

Graphs. Data structures that connect a set of objects to form a kind of a network Objects are called “Nodes” or “Vertices” Connections are called “Edges”
1 Breadth First Search AB F I EH DC G FIFO Queue - front.

1 Breadth First Search AB F I EH DC G FIFO Queue - front.
Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.

Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.
1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.

1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.
233-234233-234 Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
233-234233-234 Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
233-234233-234 Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Graphs & Graph Algorithms Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.

Graphs & Graph Algorithms Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.

1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.

1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.

Similar presentations

Ads by Google