El documento describe el proceso de realizar una búsqueda en profundidad (depth-first search) en dos gráficas diferentes, comenzando con los nodos D y H. En cada caso, se muestra cada nodo visitado y el orden en que se visitan, terminando cuando todos los nodos han sido visitados.

1. Depth First Search
Amar Jukuntla

2. A
B
F
E
H
C
G
D
Task: Conduct a depth-first search of the graph starting with node D
VISITED VERTICES

3. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C
D ✅
E
F
G
H D
D
VISITED VERTICES

4. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C ✅
D ✅
E
F
G
H
C
D
D C
VISITED VERTICES

5. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C ✅
D ✅
E
F
G
H
D
D C
VISITED VERTICES

6. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C ✅
D ✅
E ✅
F
G
H
E
D
D C E
VISITED VERTICES

7. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C ✅
D ✅
E ✅
F
G ✅
H
G
E
D
D C E G
VISITED VERTICES

8. A
B
F
E
H
C
G
D
NODE VISITED
A
B
C ✅
D ✅
E ✅
F
G ✅
H ✅
H
G
E
D
D C E G H
X
VISITED VERTICES

9. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B
C ✅
D ✅
E ✅
F
G ✅
H ✅
A
H
G
E
D
D C E G H A
X
VISITED VERTICES

10. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
B
A
H
G
E
D
D C E G H A B
X
VISITED VERTICES

11. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
A
H
G
E
D
D C E G H A B
X
VISITED VERTICES

12. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
H
G
E
D
D C E G H A B
X
VISITED VERTICES

13. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
G
E
D
D C E G H A B
XX
VISITED VERTICES

14. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
E
D
D C E G H A B
XX
VISITED VERTICES

15. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F
G ✅
H ✅
D
D C E G H A B
XX
VISITED VERTICES

16. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F ✅
G ✅
H ✅
F
D
D C E G H A B F
XX
VISITED VERTICES

17. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F ✅
G ✅
H ✅
F
D
D C E G H A B F
XX
X
VISITED VERTICES

18. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F ✅
G ✅
H ✅
D
D C E G H A B F
XX
X
VISITED VERTICES

19. A
B
F
E
H
C
G
D
NODE VISITED
A ✅
B ✅
C ✅
D ✅
E ✅
F ✅
G ✅
H ✅
-1
D C E G H A B F
XX
X
VISITED VERTICES

20. B
A
C
E F
D
G
H I
START WITH H

21. B
A
C
E F
D
G
H I
H
VISITED NODES
NODE VISITED
A
B
C
D
E
F
G
H ✅
I H

22. B
A
C
E F
D
G
H I
H E
VISITED NODES
NODE VISITED
A
B
C
D
E ✅
F
G
H ✅
I
E
H

23. B
A
C
E F
D
G
H I
H E C
VISITED NODES
NODE VISITED
A
B
C ✅
D
E ✅
F
G
H ✅
I
C
E
H

24. B
A
C
E F
D
G
H I
H E C B
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F
G
H ✅
I
B
C
E
H

25. B
A
C
E F
D
G
H I
H E C B
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F
G
H ✅
I
X
C
E
H

26. B
A
C
E F
D
G
H I
H E C B G
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F
G ✅
H ✅
I
X
G
C
E
H

27. B
A
C
E F
D
G
H I
H E C B G F
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G
H ✅
I
X
F
G
C
E
H

28. B
A
C
E F
D
G
H I
H E C B G F
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I
X
G
C
E
H
X

29. B
A
C
E F
D
G
H I
H E C B G F
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I
X
G
C
E
H
X
X

30. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X
I
G
C
E
H
X
X

31. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X
G
C
E
H
X
X

32. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X
C
E
H
X
X

33. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X
C
E
H
X
X

34. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
E
H
X
XX

35. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X E
H
X
XX

36. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X E
H
X
XX

37. B
A
C
E F
D
G
H I
H E C B G F I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X H
X
XX

38. B
A
C
E F
D
G
H I
VISITED NODES
NODE VISITED
A
B ✅
C ✅
D
E ✅
F ✅
G ✅
H ✅
I ✅
X
X
X
X
X
-1
H E C B G F I