Why doesn't Dijkstra's algorithm work with undirected graphs?

Question

Algorithms

Many sources write that Dijkstra's algorithm does not work with cycles in graphs, but I did not find an explanation

Answer 1

Потому что алгоритм Дейкстры является "жадным алгоритмом".

Answer 2

> Many sources write
For example?
Wikipedia doesn't have anything like that. There is only a restriction on the non-negativity of the weights.

Answer 3

If you slip a graph with cycles under the classical Dijkstra, then it will go in cycles and never give an answer.
What can you do. That is the algorithm. But on the other side. Why do you need to solve the problem of finding the shortest routes on cycles? Look for a real life example and you will understand that either the abstraction is "wrong" or the wrong algorithm.