# Astar Algorithm

**URL:** https://igraph.discourse.group/t/astar-algorithm/1269
**Category:** Development
**Tags:** Python
**Created:** [23 June 2022 21:11 UTC](https://igraph.discourse.group/t/astar-algorithm/1269 "2022-06-23T21:11:17Z")
**Posts on this page:** 2
**Page:** 1

<div class="post-metadata">

### Author: ![doric35](https://yyz2.discourse-cdn.com/free1/user_avatar/igraph.discourse.group/doric35/32/792_2.png) [@doric35](https://igraph.discourse.group/u/doric35)
#### Post date: [23 June 2022 21:11 UTC](https://igraph.discourse.group/t/astar-algorithm/1269/1 "2022-06-23T21:11:17Z")

</div>

Hi,

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?

---

<div class="post-metadata">

### Author: ![szhorvat](https://yyz2.discourse-cdn.com/free1/user_avatar/igraph.discourse.group/szhorvat/32/3_2.png) [@szhorvat](https://igraph.discourse.group/u/szhorvat)
#### Post date: [23 June 2022 21:28 UTC](https://igraph.discourse.group/t/astar-algorithm/1269/2 "2022-06-23T21:28:46Z")

</div>

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