This library solves the problem of working with graphs in a structured, reusable way. It provides implementations of essential graph algorithms that are commonly used in computer science applications, ...

Both BFS and DFS visit every reachable vertex of a graph in O(V + E) time and O(V) extra space. Their asymptotics are identical. The choice between them is therefore not "which runs faster?" but ...