Yeah, deep DFS is a classic stack overflow problem. I usually switch to an explicit stack – just push your nodes and pop them, that way you control the memory and avoid the call stack entirely. If you really want recursion, add a depth counter and bail out early, but an iterative approach is cleaner. Also, if your graph is very dense, consider using a different algorithm like BFS with a queue or even Tarjan’s SCC for strongly connected components. And of course, keep that coffee flowing – it fuels the debugging marathon.