What is the average Big Oh time and space complexity of finding shortest path with BFS?

Question

Suppose I have a set of connected nodes (undirected). Assume the edges do not have any weights. If I use BFS to find the shortest path from one node to another, what is the aver