EXECUTION OF ALGORITHM gbDFS

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: --

                                Stack:
                                  From: -
                                 State: A

AFTER 1st ITERATION OF WHILE LOOP:

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

AFTER 2nd ITERATION OF WHILE LOOP:

              A                 Closed list: A D
              |  
              D                 Stack:
                                  From: D D A
                                 State: E B B

AFTER 3rd ITERATION OF WHILE LOOP:

              A                 Closed list: A D E
              |  
              D                 Stack:
              |                   From: E E D A
              E                  State: C B B B

AFTER 4th ITERATION OF WHILE LOOP:

              A                 Closed list: A D E
              |  
              D                 Stack:
              |                   From: E D A
              E                  State: B B B
              |
              C

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