Added Dijkstra's algorithm to find the shortest path as well as the Prim's algorithm to find the Minimum Spanning Tree.
NOTE: Dijkstra's algorithm requires a Directed graph, whereas Prim's MST algorithm requires only a Un-Directed graph. So the inputs differ.