Breadth-First/Depth-First searching in Graph; Java
I'm a pretty useless programmer. We're supposed to read in a .txt with a 5x5 grid of numbers and write a breadth-first search method and a depth-first search methods.

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.

Thanks in advance.
Breadth-First/Depth-First searching in Graph; Java
===

I'm a pretty useless programmer. We're supposed to read in a .txt with a 5x5 grid of numbers and write a breadth-first search method and a depth-first search methods.

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.

Thanks in advance.