Can this breadth-first search be made faster?

Question

I have a data set which is a large unweighted cyclic graph The cycles occur in loops of about 5-6 paths. It consists of about 8000 nodes and each node has from 1-6 (usually abou

Answer 1

Hmm, doesn't BFS involve marking nodes you've already seen so you don't visit them again?