Class AStarPathFinder

Namespace

LibGameAI.PathFinding

Assembly

PathFinding.dll

A path finder implemented with the A* algorithm.

public class AStarPathFinder : IPathFinder

Inheritance

object

AStarPathFinder

Implements

IPathFinder

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Remarks

Optimizations to be done (some are code-related with others): TODO Use a heap/priority queue (priority heap) data structure for the open and closed nodes. TODO Either make NodeRecord structs (and update surrounding code appropriately) or use an object pool of NodeRecords. TODO Avoid always getting node record from the dictionary, just pull it once onto a local variable and use that. TODO Reuse the heuristic value from previously existing node records.

Constructors

AStarPathFinder(Func<int, float>, bool)

Create a new A* path finder.

public AStarPathFinder(Func<int, float> heuristics, bool earlyExit = false)

Parameters

heuristics Func<int, float>

Heuristic function to use.

earlyExit bool

Stop as soon as goal is found in open list with the possibility of getting a costlier path?

Properties

ClosedNodes

public IEnumerable<int> ClosedNodes { get; }

Property Value

IEnumerable<int>

OpenNodes

public IEnumerable<int> OpenNodes { get; }

Property Value

IEnumerable<int>

Methods

FindPath(IGraph, int, int)

Find a path between start and goal nodes.

public IEnumerable<IConnection> FindPath(IGraph graph, int start, int goal)

Parameters

graph IGraph

Graph where to perform search.

start int

Start node.

goal int

Goal node.

Returns

IEnumerable<IConnection>

An enumerable containing the connections that constitute a path from start to goal.