Breadth First Search

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

2. Breadth First Search - C D A B E F G H I enqueue source node A front FIFO Queue

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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