Why does my implementation of Dijkstra's algorithm fail under this undefined case?

Question

I am trying to write an implementation of Dijkstra\'s Algorithm in Prolog (specifically, GNU Prolog). To begin, I made a fact connection that describes the conn