1. Breadth First Search - A B C D E F G H I
front
FIFO Queue

2. Breadth First Search A - enqueue source node FIFO Queue front A B C DG H I
enqueue source node A
front
FIFO Queue

3. Breadth First Search A - dequeue next vertex FIFO Queue front A B C DG H I
dequeue next vertex A
front
FIFO Queue

4. Breadth First Search - visit neighbors of A FIFO Queue front A B C D E

5. Breadth First Search - visit neighbors of A FIFO Queue front A B C D E

6. Breadth First Search B - A B discovered FIFO Queue front A B C D E F G

7. Breadth First Search B - A visit neighbors of A FIFO Queue front A B C

8. Breadth First Search B I - A A I discovered FIFO Queue front A B C D EG H I A
I discovered
B I
front
FIFO Queue

9. Breadth First Search B I - A A finished with A FIFO Queue front A B CG H I A
finished with A
B I
front
FIFO Queue

10. Breadth First Search B I - A A dequeue next vertex FIFO Queue front AG H I A
dequeue next vertex
B I
front
FIFO Queue

11. Breadth First Search I - A A visit neighbors of B FIFO Queue front A B

12. Breadth First Search I - A A visit neighbors of B FIFO Queue front A B

13. Breadth First Search I F - A B A F discovered FIFO Queue front A B C DG H B I A
F discovered
I F
front
FIFO Queue

14. Breadth First Search I F - A B A visit neighbors of B FIFO Queue front

15. Breadth First Search I F - A B A A already discovered FIFO Queue frontG H B I A
A already discovered
I F
front
FIFO Queue

16. Breadth First Search I F - A B A finished with B FIFO Queue front A BG H B I A
finished with B
I F
front
FIFO Queue

17. Breadth First Search I F - A B A dequeue next vertex FIFO Queue frontG H B I A
dequeue next vertex
I F
front
FIFO Queue

18. Breadth First Search F - A B A visit neighbors of I FIFO Queue front A

19. Breadth First Search F - A B A visit neighbors of I FIFO Queue front A

20. Breadth First Search F - A B A A already discovered FIFO Queue front AG H B I A
A already discovered F
front
FIFO Queue

21. Breadth First Search F - A B A visit neighbors of I FIFO Queue front A

22. Breadth First Search F E - A I B A E discovered FIFO Queue front A B CG H I B I A
E discovered
F E
front
FIFO Queue

23. Breadth First Search F E - A I B A visit neighbors of I FIFO Queue
front
FIFO Queue

24. Breadth First Search F E - A I B A F already discovered FIFO QueueG H I B I A
F already discovered
F E
front
FIFO Queue

25. Breadth First Search F E - A I B A I finished FIFO Queue front A B C DG H I B I A
I finished
F E
front
FIFO Queue

26. Breadth First Search F E - A I B A dequeue next vertex FIFO QueueG H I B I A
dequeue next vertex
F E
front
FIFO Queue

27. Breadth First Search E - A I B A visit neighbors of F FIFO Queue front

28. Breadth First Search E G - A I B F A G discovered FIFO Queue front A B

29. Breadth First Search E G - A I B F A F finished FIFO Queue front A B C

30. Breadth First Search E G - A I B F A dequeue next vertex FIFO Queue
front
FIFO Queue

31. Breadth First Search G - A I B F A visit neighbors of E FIFO Queue
front
FIFO Queue

32. Breadth First Search G - A I B F A E finished FIFO Queue front A B C D

33. Breadth First Search G - A I B F A dequeue next vertex FIFO Queue
front
FIFO Queue

34. Breadth First Search - A I B F A visit neighbors of G FIFO Queue front

35. Breadth First Search C - A G I B F A C discovered FIFO Queue front A B

36. Breadth First Search C - A G I B F A visit neighbors of G FIFO Queue
front
FIFO Queue

37. Breadth First Search C H - A G I B F G A H discovered FIFO Queue front

38. Breadth First Search C H - A G I B F G A G finished FIFO Queue front A

39. Breadth First Search C H - A G I B F G A dequeue next vertex
front
FIFO Queue

40. Breadth First Search H - A G I B F G A visit neighbors of C FIFO Queue
front
FIFO Queue

41. Breadth First Search H D - A G C I B F G A D discovered FIFO Queue
front
FIFO Queue

42. Breadth First Search H D - A G C I B F G A C finished FIFO Queue front

43. Breadth First Search H D - A G C I B F G A get next vertex FIFO Queue
front
FIFO Queue

44. Breadth First Search D - A G C I B F G A visit neighbors of H
front
FIFO Queue

45. Breadth First Search D - A G C I B F G A finished H FIFO Queue front A

46. Breadth First Search D - A G C I B F G A dequeue next vertex
front
FIFO Queue

47. Breadth First Search - A G C I B F G A visit neighbors of D FIFO Queue
front
FIFO Queue

48. Breadth First Search - A G C I B F G A D finished FIFO Queue front A B

49. Breadth First Search - A G C I B F G A dequeue next vertex FIFO Queue
front
FIFO Queue

50. Breadth First Search A F I E H D C G - B
STOP
front
FIFO Queue