EXECUTION OF ALGORITHM gbBFS

GIVEN GRAPH (initial vertex A, destination vertex C)

                    A ---- B
                    |    / | \
                    |   /  |   C
                    |  /   | /
                    D ---- E

* ASSUME ACTIONS/ EDGES PROCEESED IN ALPHABETICAL ORDER OF 
   DESTINATION VERTEX

BEFORE 1st ITERATION OF WHILE LOOP:

                                Closed list: --

                                Queue:
                                  From: -
                                 State: A

AFTER 1st ITERATION OF WHILE LOOP:

              A                 Closed list: A
                 
                                Queue:
                                  From: A A
                                 State: B D`

AFTER 2nd ITERATION OF WHILE LOOP:

              A                 Closed list: A B
            /    
          B                     Queue:
                                  From: A B B B
                                 State: D C D E

AFTER 3rd ITERATION OF WHILE LOOP:

              A                 Closed list: A B D
            /   \
          B       D             Queue:
                                  From: B B B D
                                 State: C D E E

AFTER 4th ITERATION OF WHILE LOOP:

              A                 Closed list: A B D
            /   \
          B       D             Queue:
          |                      From:  B B D
          C                      State: D E E

    => GOAL C FOUND (return before C added to closed list)