I coded up an implementation of Dijkstra’s Algorithm.It works correctly as I had coded from a pseudocode which was very abstract for a MOOC,6 months back.
However,I wanted to know what is its running time complexity.I’m doubtful if its even O(V^2).As the graph was just of 200 vertices.I don’t know about the edges though.
Here’s the code:
 And here's the [data] I think its O(V^2*E).Though I'm not sure. : http://pastebin.com/SkHMzkaC : http://pastebin.com/GxF2evc7