Astar Algorithm


I have not found an A star Algorithm implementation in the documentation.
Have I miss it?
Is there a shortest path algorithm that uses an heuristic to optimize computation?

A* is not yet implemented. You can add your vote to the feature request here: Add A* algorithm · Issue #403 · igraph/igraph · GitHub Or, if you’re feeling up to it, you can volunteer to implement it. Note that it must be programmed in C.