title: What is time complexity of BFS depending on the representation of the graph?
body: <p>I was wondering what is the time complexity of BFS, if I use:</p>
  
  <ul>
  <li>an adjacency matrix</li>
  <li>adjacency list</li>
  <li>edge list</li>
  </ul>
  
  <p>Is it same as their space complexity?</p>