skitourenguru

No, the answer on Stackexchange makes clear, that no careful look at the parameters a,b,c,d was done.

Please take into account the third additional remark: **Calculation resolution: The difference becomes big if r=10. The difference becomes minimal with very small resolutions r=1 or r=0.1 (r.region res=r). So...

[Is Dijkstra's Algorithm symmetrical?](https://stackoverflow.com/questions/58454287/is-dijkstras-algorithm-symmetrical) If the graph is not directional, the set of shortest paths from A to B is the same as set of shortest paths from B to...

**c must be equal to d.** The following example produces a symmetrical result for all resolutions r, also for r=10: From A to B: a,b,c,d=0.72,6,-10,-10 From B to A: a,b,c,d=0.72,10,-6,-6