/Engine/Source/Runtime/AIModule/Public/GraphAStar.h
// Optionally implemented methods to parameterize the search int32 GetNeighbourCount(FNodeRef NodeRef) const; - returns number of neighbours that the graph node identified with NodeRef has, it is ok if not implemented, the logic will stop calling GetNeighbour once it received an invalid noderef bool ShouldIgnoreClosedNodes() const; - whether to revisit closed node or not bool ShouldIncludeStartNodeInPath() const; - whether to put the start node in the resulting path int32 GetMaxSearchNodes() const; - whether to limit the number of search nodes to a maximumFVector::FRealGetCostLimit() const  - whether to limit the search to a maximum cost
template<typename TGraph, typename Policy, typename TSearchNode, bool DoRangeCheck> struct FGraphAStar
const TGraph &
Graph
FNodePool
NodePool
FNodeSorter
NodeSorter
FOpenList
OpenList