Dijkstra's Algorithm on negative weight cycle

Question

Somebody please clarify me, will dijkstra’s algorithm terminate if there is a negative cycle present? (as far as I know, it doesn't give correct result as it keep updating the value, so in that logic it sould fall into infinite loop and wont terminate. Is this correct?)

Comments

dijkstras algo will terminate when all the vertices are visited once.

hence it will terminate but will give wrong result. it will not prompt you saying that the result is wrong. this is the drawback.

whereas bellman ford will say you that that shortest path is not possible because there is a -ve weight loop.

---

Dijkstra algorithm will terminate always because at each iteration it remove one node from the heap.