What is the space complexity of breadth first search algorithm?

The space complexity of the breadth-first search algorithm is O(V), where V is the number of vertices in the graph being traversed.