Python graph DFS can exceed recursion limit at 2,000 nodes #5934

The Python depth-first implementation recursively follows a component. The constraints allow a 2,000-node path, exceeding the default interpreter recursion limit. Use an explicit stack for this DFS variant.