Due: Friday, February 5th, 2010 9:40am
Try providing a 10,000-node graph to your program from HW 1. Try simple graphs, such as a linear tree that is 10,000 nodes deep, or a shallow tree where the root points to 10,000 nodes that have no outgoing edge. The example inputs deep and wide describe such graphs. You should try much larger graphs, too, and you might want to start with graphs that have 100 or 1000 nodes.
You may find that certain deep recursions are not acceptable to the implementation that you are using. You may find that you need to use different data structures or algorithms, or you may simply need to use different built-in functions to obtain a good space and time complexity.
|Last update: Wednesday, March 5th, email@example.com|