|Syntactic Confectionery Delight|
Re^15: Travelling problem (Anyone better 86850?)by LanX (Canon)
|on Dec 28, 2013 at 14:26 UTC||Need Help??|
The n shortest remaining edges¹!
You don't wanna visit a node again you've already seen. So it's not 8th cause the previous ones aren't possible anymore.
- marks already excluded nodes
! marks target node
So it's effectively the shortest remaining possibility.
( addicted to the Perl Programming Language)