yhh
61 lines
1.9 KiB
TypeScript
61 lines
1.9 KiB
TypeScript
///<reference path="../../../Math/Vector2.ts" />
|
|
/**
|
|
* 基本的未加权网格图形用于BreadthFirstPathfinder
|
|
*/
|
|
class UnweightedGridGraph implements IUnweightedGraph<Vector2> {
|
|
private static readonly CARDINAL_DIRS: Vector2[] = [
|
|
new Vector2(1, 0),
|
|
new Vector2(0, -1),
|
|
new Vector2(-1, 0),
|
|
new Vector2(0, -1)
|
|
];
|
|
|
|
private static readonly COMPASS_DIRS = [
|
|
new Vector2(1, 0),
|
|
new Vector2(1, -1),
|
|
new Vector2(0, -1),
|
|
new Vector2(-1, -1),
|
|
new Vector2(-1, 0),
|
|
new Vector2(-1, 1),
|
|
new Vector2(0, 1),
|
|
new Vector2(1, 1),
|
|
];
|
|
|
|
public walls: Vector2[] = [];
|
|
|
|
private _width: number;
|
|
private _hegiht: number;
|
|
|
|
private _dirs: Vector2[];
|
|
private _neighbors: Vector2[] = new Array(4);
|
|
|
|
constructor(width: number, height: number, allowDiagonalSearch: boolean = false) {
|
|
this._width = width;
|
|
this._hegiht = height;
|
|
this._dirs = allowDiagonalSearch ? UnweightedGridGraph.COMPASS_DIRS : UnweightedGridGraph.CARDINAL_DIRS;
|
|
}
|
|
|
|
public isNodeInBounds(node: Vector2): boolean {
|
|
return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._hegiht;
|
|
}
|
|
|
|
public isNodePassable(node: Vector2): boolean {
|
|
return !this.walls.firstOrDefault(wall => JSON.stringify(wall) == JSON.stringify(node));
|
|
}
|
|
|
|
public getNeighbors(node: Vector2) {
|
|
this._neighbors.length = 0;
|
|
|
|
this._dirs.forEach(dir => {
|
|
let next = new Vector2(node.x + dir.x, node.y + dir.y);
|
|
if (this.isNodeInBounds(next) && this.isNodePassable(next))
|
|
this._neighbors.push(next);
|
|
});
|
|
|
|
return this._neighbors;
|
|
}
|
|
|
|
public search(start: Vector2, goal: Vector2): Vector2[] {
|
|
return BreadthFirstPathfinder.search(this, start, goal);
|
|
}
|
|
} |