Dijkstra's Algorithm with Chebyshev Distance

Question

I use the Dijkstra Algorithm to find the shortest path in the Graph API defined by Princeton University Algorithm, part 2, and I figured out how to find the path with Chebyshev distance.

Despite the fact that Chebyshev can go to either side of a node with a cost of only 1, it does not affect the total cost, but, according to the schedule, a red circle, why does the path search line move in a zigzag without moving straight?

Will the same thing repeat if I use the A * algorithm?

Answer 1

" ", . - G'(V', E'), V' . , v = (v_prev, v_cur) , v_cur - , v_prev - . " " () .

, , .

Answer 2

, *, , . , , , , , .

Dijkstra A * " ", , , , . , :

• , , (G F, , Dijkstra *). , , , F-, . .
• , , , 10 11 . , . : , . , . , ( -, ), .