Dijkatra algorithm for unweighted graph

Question

hi all ,

Please tell me how much does dijkastra algoritm would take for unwaited and martix implementation

Comments

if its unweighted graph then apply BFS. It will take $\mathcal{O}(V+E)$ time only.

Answer 1

have a look below links:-

http://bigocheatsheet.com/

http://www.geeksforgeeks.org/greedy-algorithms-set-6-dijkstras-shortest-path-algorithm/