Dijkstra's algorithm: Finding shortest path from a single node

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph

Dijkstra's algorithm is applicable for:
1. Both directed and undirected graphs
2. All edges must have nonnegative weights
3. Graph must be connected

Average case time complexity: Θ(E+V log V)

Space complexity: Θ(V)

Feel free to comment your thoughts and ask any question.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/dijkstras-algorithm-finding-shortest-path-between-all-nodes/