# Graphs Review Part 2

1.  When would you pick one way to represent a graph over another?
1.  Explain the difference between depth-first-search and Breadth-first-search.
1.  What does Dijsktra's algorithm do?
1.  Where does Dijkstra's algorithm fail?
1.  Where do you use a Queue in a graph traversal?
1.  Where do you use a Stack in a graph traversal?
