Editing A* search algorithm (section)

===Termination and completeness===
On finite graphs with non-negative edge weights A* is guaranteed to terminate and is ''complete'', i.e. it will always find a solution (a path from start to goal) if one exists. On infinite graphs with a finite branching factor and edge costs that are bounded away from zero (<math display="inline">d(x,y)>\varepsilon>0</math> for some fixed <math>\varepsilon</math>), A* is guaranteed to terminate only if there exists a solution.<ref name=":2" />