Best path-finding algorithm with minimum changes of direction - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Best path-finding algorithm with minimum changes of direction

arithmeticaarithmetica Posts: 2Member
Hi everyone,
I'm trying to design an algorithm finding the shortest path between two nodes in a simple graph such that this path has the minimum number of changes of directions. So, the path would be the shortest and straightest of all. For the shortest part, I would apply a Dijkstra algorithm but I don't know how to modify it to match the straightest part.
Any help would be appreciated.
Sign In or Register to comment.