title: Breadth-first and depth-first search algorithms in a 5x5 grid of numbers
body: <p>We're supposed to read in a text file with a 5x5 grid of numbers and write a <em>breadth-first search</em> and a <em>depth-first search</em> methods.</p>
  
  <p>I'm not asking for anyone to do my homework for me, but I would like some help understanding the theory of these algorithms. Pseudocode wouldn't hurt either.</p>