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
Should be pretty easy. The A* (A star) shortest path algorithm achieved superior performance by using an estimate of the distance to the given target node.
I'd be interested to have access to A* in igraph.
I'll try to develop it in Python next week, if it works maybe it could be integrated in the wrapper? One developed in C would be faster though.
If you have a working Python version (or will have), please share it with us. If it's mature enough, I can add it to the Python interface for the next release - or, if we decide to create a version in C, we could use it to cross-validate our solution.
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
stalebot
added
the
stale
Issues that have been inactive for a long time; will be closed in the absence of further activity
label
Jan 22, 2020
Should be pretty easy. The A* (A star) shortest path algorithm achieved superior performance by using an estimate of the distance to the given target node.
https://en.wikipedia.org/wiki/A*_search_algorithm
Imported from Launchpad using lp2gh.
The text was updated successfully, but these errors were encountered: