You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Recently we change route finder algorithm, and get rid of Dijkstra (that not work as well as we need) and use a customized BFS algorithms with our minhop/maxhop logic that we need. But, this algorithm just suitable for current network size, due to these calculations:
We are in first situation right now, and if we scale up 5x, even our new algorithm Finder work good, but we should move from it to A*. See below:
I open this ticket for future and we didn't have plan for doing these changes, at least in next weeks.
The text was updated successfully, but these errors were encountered:
Recently we change route finder algorithm, and get rid of Dijkstra (that not work as well as we need) and use a customized BFS algorithms with our minhop/maxhop logic that we need. But, this algorithm just suitable for current network size, due to these calculations:
We are in first situation right now, and if we scale up 5x, even our new algorithm
Finder
work good, but we should move from it to A*. See below:I open this ticket for future and we didn't have plan for doing these changes, at least in next weeks.
The text was updated successfully, but these errors were encountered: