The topics of today's lab are:
- graph traversals


*********************
YOUR TASKS FOR TODAY
*********************

1) look at the provided implementation of Breadth First Search
2) write a method that gets two vertices s and t, and finds the shorted path from s to t

3) look at the provided implementation of Depth First Search
4) write a method that gets a vertex s, runs DFS starting from s, and prints paths from s to each v in the graph defined by the DFS tree
