DFS Fifth Edge

• Proceeding from “g” we consider “e” and “f”; edge g-e will be added to the spanning tree

• “e” has no unmarked/unvisited nodes so backtrack to “g” via recursion or a manual stack