forked from bgrins/javascript-astar
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathastar-examples.test.js
More file actions
85 lines (77 loc) · 2.32 KB
/
Copy pathastar-examples.test.js
File metadata and controls
85 lines (77 loc) · 2.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
import { expect, test } from "vitest"
import { AStar, Graph, GridNode } from "../src/astar.js"
test("AStar.search - Examples - Minimal", function() {
const graph = new Graph([
[1, 1],
[0, 1]
])
const result = AStar.search(graph, [0, 0], [1, 1])
.map(r => [r.x, r.y])
expect(result).toEqual([[0, 1], [1, 1]])
})
test("AStar.search - Examples - Complex", function() {
const graph = new Graph([
[1, 1, 0, 0, 0],
[0, 1, 1, 1, 1],
[0, 0, 1, 0, 1],
[1, 1, 1, 0, 1],
[1, 0, 1, 1, 1],
])
const result = AStar.search(graph, [0, 0], [4, 0])
.map(r => [r.x, r.y])
expect(result).toEqual([[0, 1], [1, 1], [1, 2], [2, 2], [3, 2], [3, 1], [3, 0], [4, 0]])
})
test("AStar.search - Examples - Diagonal", function() {
const graph = new Graph([
[1, 1, 1],
[1, 1, 1],
[1, 1, 1]
], { diagonal: true })
const result = AStar.search(graph, [0, 0], [2, 2])
.map(r => [r.x, r.y])
expect(result).toEqual([[1, 1], [2, 2]])
})
test("AStar.search - Examples - Closest", function() {
const graph = new Graph([
[1, 1, 1],
[0, 1, 1],
[0, 0, 0]
])
const result = AStar.search(graph, [0, 0], [2, 2], { closest: true })
.map(r => [r.x, r.y])
expect(result).toEqual([[0, 1], [1, 1], [1, 2]])
})
test("AStar.search - Examples - Weights", function() {
const graph = new Graph([
[1, 1],
[9, 1],
[1, 1]
])
const result = AStar.search(graph, [0, 0], [2, 0])
.map(r => [r.x, r.y])
expect(result).toEqual([[0, 1], [1, 1], [2, 1], [2, 0]])
})
test("AStar.search - Examples - Use grid nodes as start/end", function() {
const graph = new Graph([
[1, 1],
[0, 1]
])
const start = graph.grid[0][0]
const end = graph.grid[1][1]
const result = AStar.search(graph, start, end)
.map(r => [r.x, r.y])
expect(result).toEqual([[0, 1], [1, 1]])
})
test("AStar.search - Examples - Typed result", function() {
/** @returns {GridNode[]} */
function findPath() {
const graph = new Graph([
[1, 1],
[0, 1]
])
return AStar.search(graph, [0, 0], [1, 1])
}
const result = findPath()
expect(result).toBeInstanceOf(Array)
expect(result[0]).toBeInstanceOf(GridNode)
})