Topological Sort: DFS - PowerPoint PPT Presentation

About This Presentation
Title:

Topological Sort: DFS

Description:

Topological Sort: DFS. E. C. G. F. B. A. D. dfs(A) Undiscovered. Unfinished. Finished. Active ... Topological Sort: DFS. E. C. G. F. B. A. D. dfs(A) dfs(D) dfs ... – PowerPoint PPT presentation

Number of Views:153
Avg rating:3.0/5.0
Slides: 20
Provided by: kevin59
Category:
Tags: dfs | sort | topological

less

Transcript and Presenter's Notes

Title: Topological Sort: DFS


1
Topological Sort DFS
C
G
F
B
A
D
D
E
A
E
B
E
B
D
F
G
C
H
D
E
E
H
F
A
G
H
2
Topological Sort DFS
C
dfs(A)
G
F
B
A
D
E
Undiscovered
Unfinished
H
Active
Finished
3
Topological Sort DFS
C
dfs(A) dfs(D)
G
F
B
A
D
E
Undiscovered
Unfinished
H
Active
Finished
4
Topological Sort DFS
C
dfs(A) dfs(D) dfs(E)
G
F
B
A
D
E
Undiscovered
Unfinished
H
Active
Finished
5
Topological Sort DFS
C
dfs(A) dfs(D) dfs(E)
dfs(H)
G
F
B
A
D
E
Undiscovered
Unfinished
H
Active
Finished
6
Topological Sort DFS
C
dfs(A) dfs(D) dfs(E)
G
F
B
A
D
E
Undiscovered
Unfinished
H
7
Active
Finished
7
Topological Sort DFS
C
dfs(A) dfs(D)
G
F
B
A
D
E
6
Undiscovered
Unfinished
H
7
Active
Finished
8
Topological Sort DFS
C
dfs(A)
G
F
B
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
9
Topological Sort DFS
C

G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
10
Topological Sort DFS
C
dfs(B)
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
11
Topological Sort DFS
C
3
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
12
Topological Sort DFS
C
dfs(C)
3
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
13
Topological Sort DFS
C
dfs(C)
3
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
14
Topological Sort DFS
C
dfs(C)
3
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
15
Topological Sort DFS
C
dfs(C) dfs(F)
3
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
16
Topological Sort DFS
C
dfs(C)
3
2
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
17
Topological Sort DFS
C
dfs(C) dfs(G)
3
2
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
18
Topological Sort DFS
C
dfs(C)
3
2
1
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
19
Topological Sort DFS
C
0

3
2
1
G
F
B
4
A
D
5
E
6
Undiscovered
Unfinished
H
7
Active
Finished
Write a Comment
User Comments (0)
About PowerShow.com