And given that these exact same two claims hold for depth first search as for breadth first search, that means if we wanted to compute connected components in an undirected graph, we could equally well use an outer for loop with depth first search as our work horse in the inner 