a. Write an algorithm to determine shortest path 

b. Hook up the shortest path algorithm with the front-end/visualizer

c. Write the connected components algorithm for a disjoint graph