The corner-cost bias used when calculating the shortest path meant the path could cross over itself. Resolve by tagging vertices as well as edges to prevent stepping across vertices used by edges that have been added to the heap.
The corner-cost bias used when calculating the shortest path meant the path could cross over itself. Resolve by tagging vertices as well as edges to prevent stepping across vertices used by edges that have been added to the heap.