CocosPlugin/esengine
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

新增breadthfirst与dijkstra寻路算法

Browse Source
This commit is contained in:
yhh
2020-06-10 12:23:19 +08:00
parent 538677575d
commit 5f7c13c8cd
16 changed files with 929 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
demo/libs/framework/framework.d.ts vendored
View File

@@ -72,6 +72,69 @@ declare class PriorityQueue<T extends PriorityQueueNode> {
private swap;
private hasHigherPriority;
}
declare class BreadthFirstPathfinder {
static search<T>(graph: IUnweightedGraph<T>, start: T, goal: T): T[];
private static hasKey;
}
interface IUnweightedGraph<T> {
getNeighbors(node: T): T[];
}
declare class UnweightedGraph<T> implements IUnweightedGraph<T> {
edges: Map<T, T[]>;
addEdgesForNode(node: T, edges: T[]): this;
getNeighbors(node: T): T[];
}
declare class Point {
x: number;
y: number;
constructor(x: number, y: number);
}
declare class UnweightedGridGraph implements IUnweightedGraph<Point> {
private static readonly CARDINAL_DIRS;
private static readonly COMPASS_DIRS;
walls: Point[];
private _width;
private _hegiht;
private _dirs;
private _neighbors;
constructor(width: number, height: number, allowDiagonalSearch?: boolean);
isNodeInBounds(node: Point): boolean;
isNodePassable(node: Point): boolean;
getNeighbors(node: Point): Point[];
search(start: Point, goal: Point): Point[];
}
interface IWeightedGraph<T> {
getNeighbors(node: T): T[];
cost(from: T, to: T): number;
}
declare class WeightedGridGraph implements IWeightedGraph<Point> {
static readonly CARDINAL_DIRS: Point[];
private static readonly COMPASS_DIRS;
walls: Point[];
weightedNodes: Point[];
defaultWeight: number;
weightedNodeWeight: number;
private _width;
private _height;
private _dirs;
private _neighbors;
constructor(width: number, height: number, allowDiagonalSearch?: boolean);
isNodeInBounds(node: Point): boolean;
isNodePassable(node: Point): boolean;
search(start: Point, goal: Point): Point[];
getNeighbors(node: Point): Point[];
cost(from: Point, to: Point): number;
}
declare class WeightedNode<T> extends PriorityQueueNode {
data: T;
constructor(data: T);
}
declare class WeightedPathfinder {
static search<T>(graph: IWeightedGraph<T>, start: T, goal: T): T[];
private static hasKey;
private static getKey;
static recontructPath<T>(cameFrom: Map<T, T>, start: T, goal: T): T[];
}
declare abstract class Component {
entity: Entity;
displayRender: egret.DisplayObject;
@@ -266,6 +329,7 @@ declare class Mesh extends Component {
setVertPosition(positions: Vector2[]): this;
setTriangles(triangles: number[]): this;
recalculateBounds(): this;
render(): void;
}
declare class VertexPosition {
position: Vector2;
@@ -422,11 +486,6 @@ declare class Matrix2D {
static createRotation(radians: number, result?: Matrix2D): Matrix2D;
static createScale(xScale: number, yScale: number, result?: Matrix2D): Matrix2D;
}
declare class Point {
x: number;
y: number;
constructor(x: number, y: number);
}
declare class Rectangle {
x: number;
y: number;

247
demo/libs/framework/framework.js
View File

@@ -343,7 +343,7 @@ var AstarGridGraph = (function () {
return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;
};
AstarGridGraph.prototype.isNodePassable = function (node) {
return !this.walls.contains(node);
return !this.walls.firstOrDefault(function (wall) { return JSON.stringify(wall) == JSON.stringify(node); });
};
AstarGridGraph.prototype.search = function (start, goal) {
return AStarPathfinder.search(this, start, goal);
@@ -494,6 +494,242 @@ var PriorityQueue = (function () {
};
return PriorityQueue;
}());
var BreadthFirstPathfinder = (function () {
function BreadthFirstPathfinder() {
}
BreadthFirstPathfinder.search = function (graph, start, goal) {
var _this = this;
var foundPath = false;
var frontier = [];
frontier.unshift(start);
var cameFrom = new Map();
cameFrom.set(start, start);
var _loop_3 = function () {
var current = frontier.shift();
if (JSON.stringify(current) == JSON.stringify(goal)) {
foundPath = true;
return "break";
}
graph.getNeighbors(current).forEach(function (next) {
if (!_this.hasKey(cameFrom, next)) {
frontier.unshift(next);
cameFrom.set(next, current);
}
});
};
while (frontier.length > 0) {
var state_2 = _loop_3();
if (state_2 === "break")
break;
}
return foundPath ? AStarPathfinder.recontructPath(cameFrom, start, goal) : null;
};
BreadthFirstPathfinder.hasKey = function (map, compareKey) {
var iterator = map.keys();
var r;
while (r = iterator.next(), !r.done) {
if (JSON.stringify(r.value) == JSON.stringify(compareKey))
return true;
}
return false;
};
return BreadthFirstPathfinder;
}());
var UnweightedGraph = (function () {
function UnweightedGraph() {
this.edges = new Map();
}
UnweightedGraph.prototype.addEdgesForNode = function (node, edges) {
this.edges.set(node, edges);
return this;
};
UnweightedGraph.prototype.getNeighbors = function (node) {
return this.edges.get(node);
};
return UnweightedGraph;
}());
var Point = (function () {
function Point(x, y) {
this.x = x;
this.y = y;
}
return Point;
}());
var UnweightedGridGraph = (function () {
function UnweightedGridGraph(width, height, allowDiagonalSearch) {
if (allowDiagonalSearch === void 0) { allowDiagonalSearch = false; }
this.walls = [];
this._neighbors = new Array(4);
this._width = width;
this._hegiht = height;
this._dirs = allowDiagonalSearch ? UnweightedGridGraph.COMPASS_DIRS : UnweightedGridGraph.CARDINAL_DIRS;
}
UnweightedGridGraph.prototype.isNodeInBounds = function (node) {
return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._hegiht;
};
UnweightedGridGraph.prototype.isNodePassable = function (node) {
return !this.walls.firstOrDefault(function (wall) { return JSON.stringify(wall) == JSON.stringify(node); });
};
UnweightedGridGraph.prototype.getNeighbors = function (node) {
var _this = this;
this._neighbors.length = 0;
this._dirs.forEach(function (dir) {
var next = new Point(node.x + dir.x, node.y + dir.y);
if (_this.isNodeInBounds(next) && _this.isNodePassable(next))
_this._neighbors.push(next);
});
return this._neighbors;
};
UnweightedGridGraph.prototype.search = function (start, goal) {
return BreadthFirstPathfinder.search(this, start, goal);
};
UnweightedGridGraph.CARDINAL_DIRS = [
new Point(1, 0),
new Point(0, -1),
new Point(-1, 0),
new Point(0, -1)
];
UnweightedGridGraph.COMPASS_DIRS = [
new Point(1, 0),
new Point(1, -1),
new Point(0, -1),
new Point(-1, -1),
new Point(-1, 0),
new Point(-1, 1),
new Point(0, 1),
new Point(1, 1),
];
return UnweightedGridGraph;
}());
var WeightedGridGraph = (function () {
function WeightedGridGraph(width, height, allowDiagonalSearch) {
if (allowDiagonalSearch === void 0) { allowDiagonalSearch = false; }
this.walls = [];
this.weightedNodes = [];
this.defaultWeight = 1;
this.weightedNodeWeight = 5;
this._neighbors = new Array(4);
this._width = width;
this._height = height;
this._dirs = allowDiagonalSearch ? WeightedGridGraph.COMPASS_DIRS : WeightedGridGraph.CARDINAL_DIRS;
}
WeightedGridGraph.prototype.isNodeInBounds = function (node) {
return 0 <= node.x && node.x < this._width && 0 <= node.y && node.y < this._height;
};
WeightedGridGraph.prototype.isNodePassable = function (node) {
return !this.walls.firstOrDefault(function (wall) { return JSON.stringify(wall) == JSON.stringify(node); });
};
WeightedGridGraph.prototype.search = function (start, goal) {
return WeightedPathfinder.search(this, start, goal);
};
WeightedGridGraph.prototype.getNeighbors = function (node) {
var _this = this;
this._neighbors.length = 0;
this._dirs.forEach(function (dir) {
var next = new Point(node.x + dir.x, node.y + dir.y);
if (_this.isNodeInBounds(next) && _this.isNodePassable(next))
_this._neighbors.push(next);
});
return this._neighbors;
};
WeightedGridGraph.prototype.cost = function (from, to) {
return this.weightedNodes.find(function (t) { return JSON.stringify(t) == JSON.stringify(to); }) ? this.weightedNodeWeight : this.defaultWeight;
};
WeightedGridGraph.CARDINAL_DIRS = [
new Point(1, 0),
new Point(0, -1),
new Point(-1, 0),
new Point(0, 1)
];
WeightedGridGraph.COMPASS_DIRS = [
new Point(1, 0),
new Point(1, -1),
new Point(0, -1),
new Point(-1, -1),
new Point(-1, 0),
new Point(-1, 1),
new Point(0, 1),
new Point(1, 1),
];
return WeightedGridGraph;
}());
var WeightedNode = (function (_super) {
__extends(WeightedNode, _super);
function WeightedNode(data) {
var _this = _super.call(this) || this;
_this.data = data;
return _this;
}
return WeightedNode;
}(PriorityQueueNode));
var WeightedPathfinder = (function () {
function WeightedPathfinder() {
}
WeightedPathfinder.search = function (graph, start, goal) {
var _this = this;
var foundPath = false;
var cameFrom = new Map();
cameFrom.set(start, start);
var costSoFar = new Map();
var frontier = new PriorityQueue(1000);
frontier.enqueue(new WeightedNode(start), 0);
costSoFar.set(start, 0);
var _loop_4 = function () {
var current = frontier.dequeue();
if (JSON.stringify(current.data) == JSON.stringify(goal)) {
foundPath = true;
return "break";
}
graph.getNeighbors(current.data).forEach(function (next) {
var newCost = costSoFar.get(current.data) + graph.cost(current.data, next);
if (!_this.hasKey(costSoFar, next) || newCost < costSoFar.get(next)) {
costSoFar.set(next, newCost);
var priprity = newCost;
frontier.enqueue(new WeightedNode(next), priprity);
cameFrom.set(next, current.data);
}
});
};
while (frontier.count > 0) {
var state_3 = _loop_4();
if (state_3 === "break")
break;
}
return foundPath ? this.recontructPath(cameFrom, start, goal) : null;
};
WeightedPathfinder.hasKey = function (map, compareKey) {
var iterator = map.keys();
var r;
while (r = iterator.next(), !r.done) {
if (JSON.stringify(r.value) == JSON.stringify(compareKey))
return true;
}
return false;
};
WeightedPathfinder.getKey = function (map, compareKey) {
var iterator = map.keys();
var valueIterator = map.values();
var r;
var v;
while (r = iterator.next(), v = valueIterator.next(), !r.done) {
if (JSON.stringify(r.value) == JSON.stringify(compareKey))
return v.value;
}
return null;
};
WeightedPathfinder.recontructPath = function (cameFrom, start, goal) {
var path = [];
var current = goal;
path.push(goal);
while (current != start) {
current = this.getKey(cameFrom, current);
path.push(current);
}
path.reverse();
return path;
};
return WeightedPathfinder;
}());
var Component = (function () {
function Component() {
this._enabled = true;
@@ -1403,6 +1639,8 @@ var Mesh = (function (_super) {
this._height = max.y - this._topLeftVertPosition.y;
return this;
};
Mesh.prototype.render = function () {
};
return Mesh;
}(Component));
var VertexPosition = (function () {
@@ -2129,13 +2367,6 @@ var Matrix2D = (function () {
Matrix2D._identity = new Matrix2D(1, 0, 0, 1, 0, 0);
return Matrix2D;
}());
var Point = (function () {
function Point(x, y) {
this.x = x;
this.y = y;
}
return Point;
}());
var Rectangle = (function () {
function Rectangle(x, y, width, height) {
this.x = x;

2
demo/libs/framework/framework.min.js vendored
View File

File diff suppressed because one or more lines are too long