KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I want to do DFS on a 100 X 100 array. (Say elements of array represents graph nodes) So assuming worst case, depth of recursive function calls can go upto 10000 with each call taking upto say 20 bytes. So is it feasible means is there a possibility of stackoverflow? What is the maximum size of stack in C/C++? Please specify for gcc for both 1) cygwin on Windows 2) Unix What are the general limits?
Tags (comma-separated)
Save Edits
Cancel