Dijkstra algorithm always give me an infinite loop and I couldn't find why

Question

I\'m implementing Dijkstra algorithm to find the shortest path between two nodes in a graph, although I see the code is currect it does not work for most of the examples and