I am trying to compare the time taken by Depth First Search vs Breadth First Search on a very large graph (a roadmap with 1088092 nodes, 3083796 edges).
Currently, I
