Changes

*They must have a single start point, and a single finish point.

*They must have a single start point, and a single finish point.

There is, another, a second type of algorithm - whereas most algorithms provably evaluate the most desirable end-state (for example, it is possible to mathematically prove that Dijkstra's algorithm gives the shortest route from one point to another), others are known as 'heuristic algorithms'. These are algorithms that, although giving a fairly good result, cannot provably give the best solution. While this may seem inferior, some problems are very different or even impossible to map out using normal algorithms, so heuristic ones are superior.

There is a second type of algorithm - whereas most algorithms provably evaluate the most desirable end-state (for example, it is possible to mathematically prove that Dijkstra's algorithm gives the shortest route from one point to another) - others known as 'heuristic algorithms', which, although giving a fairly good result, cannot provably give the best solution. While this may seem inferior, some problems are very difficult or even impossible to map out using normal algorithms, so heuristic ones are superior in these cases.

==Examples of Algorithms==

==Examples of Algorithms==