Skip to main content
Question

Which algorithm is used in the ShortestPathFinder and NetworkCostCalculator?


I'm assuming it's either Dijkstra's or A*, but would like to know for definite! Cheers in advance!

2 replies

Forum|alt.badge.img+2

@ejm​ Both I believe. When cost is by length A* is used. Otherwise Dijkstra's 


  • Author
  • June 10, 2021
markatsafe wrote:

@ejm​ Both I believe. When cost is by length A* is used. Otherwise Dijkstra's 

That is very helpful as I have to precisely specify in my thesis which are being used. Cheers!


Cookie policy

We use cookies to enhance and personalize your experience. If you accept you agree to our full cookie policy. Learn more about our cookies.

 
Cookie settings