From Wikipedia :
the algorithm requires
time in the worst case;
for connected graphs this time bound can be simplified to
1. Can somebody explain how are we combing (V+E) into E in case of connected graph and why it can't be combined in case of disconnected graph?
2. What will be dijakstra behaviour for disconnected graph?