Game map graph implementation.
The colors on the graph represent the adirectional passability on the map (tiles not passable by either direction will be considered unpassable), and weights are calculated using Manhattan distance (tiled walk distance).
true if the point is inside the grid.
true
Manhattan distance between vertices.
Euclidean distance between vertices.
Octile distance between vertices.
Generated using TypeDoc
Game map graph implementation.
The colors on the graph represent the adirectional passability on the map (tiles not passable by either direction will be considered unpassable), and weights are calculated using Manhattan distance (tiled walk distance).