This algorithm implements a heuristic :math:`A^*` search on a weighted, directed or undirected graph for the case where all edge weights are non-negative.
Heuristic :math:`A^*` search on a weighted, directed or undirected graph for the case where all edge weights are non-negative.