1. Breadth First Search AB F I EH DC G FIFO Queue - front

2. Breadth First Search AB F I EH DC G A FIFO Queue - front enqueue source node

3. Breadth First Search AB F I EH DC G A FIFO Queue - front dequeue next vertex

4. Breadth First Search front visit neighbors of A AB F I EH DC G - FIFO Queue

5. Breadth First Search front visit neighbors of A AB F I EH DC G - FIFO Queue

6. Breadth First Search B front B discovered AB F I EH DC G - A FIFO Queue

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

8. Breadth First Search B I front I discovered A F I EH DC G - B A A FIFO Queue

9. Breadth First Search B I front finished with A A F I EH DC G - B A A FIFO Queue

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

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

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

13. Breadth First Search I F front F I EH DC G - B A A F discovered B FIFO Queue A

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

15. Breadth First Search I F front F I EH DC G - B A A A already discovered B FIFO Queue A

16. Breadth First Search I F front F I EH DC G - B A A finished with B B FIFO Queue A

17. Breadth First Search I F front F I EH DC G - A A dequeue next vertex B FIFO Queue BA

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

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

20. Breadth First Search F front F I EH DC G - A A A already discovered B FIFO Queue BA

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

22. Breadth First Search F E front F I EH DC G - A A E discovered B I FIFO Queue BA

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

24. Breadth First Search F E front F I EH DC G - A A F already discovered B I FIFO Queue BA

25. Breadth First Search F E front F I EH DC G - A A I finished B I FIFO Queue BA

26. Breadth First Search F E front FEH DC G - A A dequeue next vertex B I FIFO Queue BA I

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

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

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

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

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

32. Breadth First Search G front H DC G - A A E finished B I F FIFO Queue I F BA E

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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