FlameDuck #1 Also aStar is best used on a dense graph (where most nodes have connections to most other nodes). If you have a sparse graph, where most nodes only have connections to a few other nodes, Djikstras Shortest Path Tree Algorithm is probably better.