Graph algorhytm not working properly

[blackboxx]

Hello. I've just started to use this library, but it seems that it is not creating shortest path well.
Let me show my example:
Im trying to get from top left corner to bottom right corner.
I create a graph 100 x 100 and then connecting nodes, which are red.
I use PIL to analyze image to get all pixels that are red (route)

This image works good
https://www.dropbox.com/s/vasji38qxvzvamo/test_route_good.jpg?dl=0

But this is not!
https://www.dropbox.com/s/bvmup96t1ckbeuh/test_route_bad.jpg?dl=0

Here is my source code:
https://www.dropbox.com/s/ezpzkklun7ut0kz/dijkstra_not_working.zip?dl=0

Here is corresponding Stackovewflow question
https://stackoverflow.com/questions/50307453/deijkstar-shortest-path-not-working

[wylee]

I'd be happy to look into this if you can post your setup code and sample inputs here on GitHub.

[Shapedsundew9]

See pull request: #2