For no-edge ("infinity", MaxShort) weights in the graph, display a " x" or " -1" in TheLog file.
That would be... when you''re picking a target, and all you can find (out of the still-eligible distances) is an infinity for the minimum. So... "emergency exit" case out of the while loop (which isn''t in the pseudocode algorithm).
For Eden to Barnes, that''d happen right away.
If you searched Europe for Warsaw to London, it would take awhile, but eventually you couldn''t find a legitimate target.
Http://homepages.wmich.edu/~kaminski/3310/