Presentation is loading. Please wait.

Presentation is loading. Please wait.

Undirected Depth First Search

Published byAgnes Freeman Modified over 6 years ago

Similar presentations

Presentation on theme: "Undirected Depth First Search"— Presentation transcript:

1 Undirected Depth First Search
B C G 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: D E F Source:

2 Undirected Depth First Search
B C G D E F newly discovered F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

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

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

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

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

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

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

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

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

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

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

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

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

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

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

17 Undirected Depth First Search
C newly discovered C B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

18 Undirected Depth First Search
A already marked B C G D E visit(C) (C, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

19 Undirected Depth First Search
B C G D E Finished C visit(C) (C, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

20 Undirected Depth First Search
B newly discovered B B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

21 Undirected Depth First Search
A already marked B C G D E visit(B) (B, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

22 Undirected Depth First Search
B C G D E Finished B visit(B) (B, A) F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

23 Undirected Depth First Search
G already finished B C G D E F visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

24 Undirected Depth First Search
B C G D E F Finished A visit(A) (A, F) (A, C) (A, B) (A, G) Undiscovered Marked Active Finished Stack

25 Undirected Depth First Search
B C G D E F Undiscovered Marked Active Finished Stack

26 Undirected Depth First Search
I newly discovered I I B C G D E F visit(H) (H, I) Undiscovered Marked Active Finished Stack

27 Undirected Depth First Search
H already marked B C G D E visit(I) (I, H) F visit(H) (H, I) Undiscovered Marked Active Finished Stack

28 Undirected Depth First Search
B C G D E Finished I visit(I) (I, H) F visit(H) (H, I) Undiscovered Marked Active Finished Stack

29 Undirected Depth First Search
B C G D E F FinishedH visit(H) (H, I) Undiscovered Marked Active Finished Stack

30 Undirected Depth First Search
B C G D E F Undiscovered Marked Active Finished Stack

31 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: B H C G I D E F

32 Directed Depth First Search
B H C G I D E F dfs(A) A-F A-G Function call stack:

33 Directed Depth First Search
B H C G I D visit(F) F-E E F dfs(A) A-F A-G Function call stack:

34 Directed Depth First Search
B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

35 Directed Depth First Search
dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

36 Directed Depth First Search
dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

37 Directed Depth First Search
dfs(D) D-C D-F dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

38 Directed Depth First Search
dfs(D) D-C D-F dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

39 Directed Depth First Search
dfs(D) D-C D-F dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

40 Directed Depth First Search
dfs(C) C-A C-D B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

41 Directed Depth First Search
B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

42 Directed Depth First Search
B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

43 Directed Depth First Search
dfs(G) B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

44 Directed Depth First Search
B H C G dfs(E) E-C E-D E-G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

45 Directed Depth First Search
B H C G I D dfs(F) F-E E F dfs(A) A-F A-G Function call stack:

46 Directed Depth First Search
B H C G I D E F dfs(A) A-F A-G Function call stack:

47 Directed Depth First Search
B H C G I D E F dfs(A) A-F A-G Function call stack:

48 Directed Depth First Search
B H C G I D E F Nodes reachable from A: A, C, D, E, F, G

Download ppt "Undirected Depth First Search"

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)
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.
Topological Sort Topological sort is the list of vertices in the reverse order of their finishing times (post-order) of the depth-first search. Topological.

Topological Sort Topological sort is the list of vertices in the reverse order of their finishing times (post-order) of the depth-first search. Topological.
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 II Kruse and Ryba Chapter 12. Undirected Graph Example: Subway Map.

Graphs II Kruse and Ryba Chapter 12. Undirected Graph Example: Subway Map.
1 Undirected Breadth First Search F A BCG DE H Source:

1 Undirected Breadth First Search F A BCG DE H Source:
Graphs Searching. Graph Searching Given: a graph G = (V, E), directed or undirected Goal: methodically explore every vertex and every edge Ultimately:

Graphs Searching. Graph Searching Given: a graph G = (V, E), directed or undirected Goal: methodically explore every vertex and every edge Ultimately:
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.
Graph Traversals Introduction Breadth-First Traversal. The Algorithm.

Graph Traversals Introduction Breadth-First Traversal. The Algorithm.
233-234233-234 Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
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.

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.
Fall 2006EE 5301 - VLSI Design Automation I 1 Depth-First Search Algorithm acdeb b · c · d · e · a · b·d·c·a·d·a·e·b·b·a·d· dfs(“a”).... dfs(“a”).... a.

Fall 2006EE VLSI Design Automation I 1 Depth-First Search Algorithm acdeb b · c · d · e · a · b·d·c·a·d·a·e·b·b·a·d· dfs(“a”).... dfs(“a”).... a.
1 Topological Sort: DFS E C GFB AD A: BDFG B: C: D: E: E F: DE A E H H G: H:

1 Topological Sort: DFS E C GFB AD A: BDFG B: C: D: E: E F: DE A E H H G: H:
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.
Graph Traversal Discrete Mathematics and Its Applications Baojian Hua

Graph Traversal Discrete Mathematics and Its Applications Baojian Hua
1 Topological Sort: DFS F C G A B D E H. 2 F C G A B D E H dfs(A)

1 Topological Sort: DFS F C G A B D E H. 2 F C G A B D E H dfs(A)
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.
1 Chapter 22: Elementary Graph Algorithms II. 2 About this lecture Depth First Search DFS Tree and DFS Forest Properties of DFS Parenthesis theorem (very.

1 Chapter 22: Elementary Graph Algorithms II. 2 About this lecture Depth First Search DFS Tree and DFS Forest Properties of DFS Parenthesis theorem (very.

Similar presentations

Ads by Google