What is time complexity of BFS depending on the representation of the graph?

Question

I was wondering what is the time complexity of BFS, if I use:

• an adjacency matrix
• adjacency list
• edge list

Is it same as their spa

Answer 1

Time complexity necessarily depends on the representation.

As this link suggests, the time complexity with and adjacency list is O(V + E), and with an adjacency matrix is O(V²).