title: BFS and DFS on Adjacency List
body: <p>So I know the basics of Breadth First Search and Depth First Search on graphs but I can't seem to figure out how to perform both of them on a adjacency list. Each search starts at 0.</p>
  
  <p>0 -> 5 -> 2 -> 1 -> 6</p>
  
  <p>1 -> 7 -> 0</p>
  
  <p>2 -> 7 -> 0</p>
  
  <p>3 -> 5 -> 4</p>
  
  <p>4 -> 6 -> 5 -> 7 -> 3</p>
  
  <p>5 -> 0 -> 4 -> 3</p>
  
  <p>6 -> 4 -> 0</p>
  
  <p>7 -> 1 -> 2 -> 0 -> 4</p>
  
  <p>I'm not sure where to start. I need to learn this so if you could please explain that would be great. </p>