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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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