Class AstarGridGraph

基本静态网格图与A*一起使用将walls添加到walls HashSet，并将加权节点添加到weightedNodes

Hierarchy

AstarGridGraph

Implements

IAstarGraph<Vector2>

Index

Constructors

constructor

Properties

Methods

Constructors

constructor

new AstarGridGraph(width: number, height: number): AstarGridGraph

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:21
Parameters
- width: number
- height: number
Returns AstarGridGraph

Properties

Private _height

_height: any

Private _neighbors

_neighbors: Vector2[] = new Array(4)

Private _width

_width: any

defaultWeight

defaultWeight: number = 1

dirs

dirs: Vector2[] = [new Vector2(1, 0),new Vector2(0, -1),new Vector2(-1, 0),new Vector2(0, 1)]

walls

walls: Vector2[] = []

weightedNodeWeight

weightedNodeWeight: number = 5

weightedNodes

weightedNodes: Vector2[] = []

Methods

cost

cost(from: Vector2, to: Vector2): number

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:65
Parameters
- from: Vector2
- to: Vector2
Returns number

getNeighbors

getNeighbors(node: Vector2): Vector2[]

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:53
Parameters
- node: Vector2
Returns Vector2[]

heuristic

heuristic(node: Vector2, goal: Vector2): number

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:69
Parameters
- node: Vector2
- goal: Vector2
Returns number

isNodeInBounds

isNodeInBounds(node: Vector2): boolean

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:32
确保节点在网格图的边界内

Parameters
- node: Vector2
Returns boolean

isNodePassable

isNodePassable(node: Vector2): boolean

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:40
检查节点是否可以通过。walls是不可逾越的。

Parameters
- node: Vector2
Returns boolean

search

search(start: Vector2, goal: Vector2): Vector2[]

- Defined in src/AI/Pathfinding/AStar/AstarGridGraph.ts:49
调用AStarPathfinder.search的快捷方式

Parameters
- start: Vector2
- goal: Vector2
Returns Vector2[]

Generated using TypeDoc