Dfs calls itself recursively; increasing numEdges increases the recursion depth so, consequently, increasing numEdges sufficiently causes a stack overflow (which manifests as a segfault on your platform).
It's most likely that you're recursing too deeply, causing a stack overflow. On most platforms, the stack has a fixed size; you may be able to make it bigger, but you probably still won't be able to support arbitrarily large graphs.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.