Welcome to the new platform of Programmers 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 it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Best finding path algorithms with minimum changes of direction
I'm trying to design an algorithm finding the shortest path between two nodes in a 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 this to match the straightest part.
Any help would be appreciated.