This page is archived

• It is possible that 1000 trials of the "bfs vs dfs" experiment will take too much time. If this is the case for your implementation reduce the number of trials to 200.

• For the comparison of the two implementations of bfs, turn in a plot of the running times of two implementations. Write a brief explanation for the plot (about 4-5 sentences or less) explaining the differences in the plot. This will take one sheet of paper; bring this to class on Wednesday 11/13; submit your project electronically using the "submit" program, as before.

• The ladders graph may contain pairs of nodes between which there is no path. In randomly generating pairs of nodes, you may occasionally pick up pairs between which there is no path. You can discover this by observing a -1 for distance from source to destination. In your experiment comparing lengths of bfs paths and lengths of dfs paths you might want to skip over (ignore) such pairs.

• Make sure that the names you use are exactly as specified in the project handout. Also make sure that any programs you submit compile in Linux. A program that does not compile will fetch no points.