🏗️ ΘρϵηΠατπ🚧 (under construction)

DFS is not Complete
Suppose that s,g are two connected vertices in a potentially infinite graph with a maximum branching factor of bN0, then it's possible that DFS may not find a path connecting s and g.
DFS Example

Assuming that we push characters onto the frontier in alphabetical order (A before B ...), specify the order of the nodes that would be explored by DFS with no cycle checking. Assume that S is the initial node, while G is the goal node.