https://www.lavishsoft.com/wiki/api.php?action=feedcontributions&user=DIE+HARD&feedformat=atomLavish Software Wiki - User contributions [en]2021-10-17T15:55:40ZUser contributionsMediaWiki 1.33.0https://www.lavishsoft.com/wiki/index.php?title=LavishNav:Pathfinders&diff=6366LavishNav:Pathfinders2006-10-24T17:12:27Z<p>DIE HARD: /* Dijkstra's */</p>
<hr />
<div>== Introduction ==<br />
=== What is a Pathfinder? ===<br />
A pathfinder is a system of finding the shortest path from one location to another. LavishNav currently provides two systems that are useful in different circumstances.<br />
<br />
== A* ==<br />
[http://en.wikipedia.org/wiki/A%2A A*] is generally the pathfinder of choice when there are no overlapping coordinate systems. In other words, if there is more than one 0,0,0 (or some other location) in the possible path, A* is not going to be preferable. This is because A* uses the distance from the goal in its estimation of the shortest path in order to find the shortest directed path to the goal. <br />
<br />
Unlike Dijkstra's, this pathfinder is only optimized such that subsequent searches are not optimized unless both the start and destination locations remain the same. This is because the stored information is based on a path directed toward the previous destination.<br />
<br />
== Dijkstra's ==<br />
[http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm Dijkstra's] is the pathfinder of choice when there are multiple coordinate systems (overlaps in the coordinate system), or when looking for the shortest path (or distance) to many different locations. <br />
<br />
This pathfinder is optimized such that subsequent searches with the same starting location can use the same information without recalculating for regions that have already been processed, and therefore it is highly efficient to continue to use the same starting location.<br />
<br />
== See Also ==<br />
* [[LavishNav]]<br />
<br />
[[Category:LavishNav]]</div>DIE HARD