FringeAstar<E> class final Pathfinding

Pathfinding algorithm that finds an optimal shortest path using a heuristic.

Fringe, or a variant of A*, is an informed search algorithm sits in between IDA* and Astar; it uses a Heuristic to estimate the cost to reach the goal from a given node and repeats states in the fringe, or frontier, of the search space.

Fringe is considered faster than Astar for Grid-based pathfinding.

A default singleton instance of this class is fringeAstar.

Mixed-in types

Constructors

FringeAstar()
Creates a new Fringe algorithm.
const

Properties

hashCode → int
The hash code for this object.
no setterinherited
runtimeType → Type
A representation of the runtime type of the object.
no setterinherited

Methods

asBestPathfinder<G extends Goal<E>>({required Heuristic<T> toNode<T extends E>(E), required Heuristic<T> orElse<T extends E>(E, G)}) → BestPathfinder<E>
Adapts this HeuristicPathfinder to a BestPathfinder.
inherited
findBestPath<T extends E>(WeightedWalkable<T> graph, T start, Goal<T> goal, Heuristic<T> heuristic, {Tracer<T>? tracer}) → (Path<T>, double)
Returns an optimal path (and it's total cost) in graph from start to a node that satisfies goal.
inherited
findBestPathExclusive<T extends E>(WeightedWalkable<T> graph, T start, Goal<T> goal, Heuristic<T> heuristic, {Tracer<T>? tracer}) → (Path<T>, double)
Returns an optimal path (and it's total cost) in graph from start to a node that satisfies goal.
override
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
inherited
toString() → String
A string representation of this object.
inherited

Operators

operator ==(Object other) → bool
The equality operator.
inherited