#Dijkstra's Shortest Path
Dijkstra's shortest path algorithm is greedy technique to find shortest distance in a directed graph.
##How to use
- Alter dijkstraData.txt file to input your graph nodes.
##Coded by Reet Awwsum
NOTE: Running time - O(|V||E|)