In a DFS, we always explore the deepest node; that is, we go one path as deep as possible, and if we hit the dead end, we back up and try a different path until we reach the end.
Untitled
Uses a stack to remember where it should go
Application :
Cycle detection :
Encounter new edge that points to already visited vertex = cycle
