X-Git-Url: https://git.dogcows.com/gitweb?p=chaz%2Fcarfire;a=blobdiff_plain;f=CarFire%2FCarFire%2FCarFire%2FPathFinder.cs;h=ef41370ef4a3fc442b623d3a7d1d2be3c4748ab0;hp=02c645cc8f8ed4c71e20705b96951a627acd15b4;hb=122c062297acac44673e947b666c1d72cd23fb1b;hpb=188525be158d8ba27fbbedf699eec5df59c5a2ee
diff --git a/CarFire/CarFire/CarFire/PathFinder.cs b/CarFire/CarFire/CarFire/PathFinder.cs
index 02c645c..ef41370 100644
--- a/CarFire/CarFire/CarFire/PathFinder.cs
+++ b/CarFire/CarFire/CarFire/PathFinder.cs
@@ -68,7 +68,7 @@ namespace CarFire
/// The cell to start at.
/// The desired destination.
/// A list of points representing the path through the grid,
- /// ends points not included, or null if no path could be found.
+ /// starting point not included, or null if no path could be found.
public List GetPath(Point start, Point finish)
{
return GetPath(start, finish, GetManhattanDistance, GetCost);
@@ -82,7 +82,7 @@ namespace CarFire
/// The desired destination.
/// The heuristic function.
/// A list of points representing the path through the grid,
- /// ends points not included, or null if no path could be found.
+ /// starting point not included, or null if no path could be found.
public List GetPath(Point start, Point finish, Heuristic heuristic)
{
return GetPath(start, finish, heuristic, GetCost);
@@ -96,7 +96,7 @@ namespace CarFire
/// The desired destination.
/// The cost function
/// A list of points representing the path through the grid,
- /// ends points not included, or null if no path could be found.
+ /// starting point not included, or null if no path could be found.
public List GetPath(Point start, Point finish, CostFunction costFunction)
{
return GetPath(start, finish, GetManhattanDistance, costFunction);
@@ -110,7 +110,7 @@ namespace CarFire
/// The heuristic function.
/// The cost function.
/// A list of points representing the path through the grid,
- /// ends points not included, or null if no path could be found.
+ /// starting point not included, or null if no path could be found.
public List GetPath(Point start, Point finish, Heuristic heuristic, CostFunction costFunction)
{
mFringe = new BinaryHeap();
@@ -127,13 +127,10 @@ namespace CarFire
if (cell.Point == finish)
{
List list = new List();
+ list.Add(cell.Point);
cell = cell.Parent;
- while (cell != null && cell.Point != start)
- {
- list.Add(cell.Point);
- cell = cell.Parent;
- }
+ if (cell != null) for (; cell.Point != start; cell = cell.Parent) list.Add(cell.Point);
list.Reverse();
return list;
|