This library includes
- path finding algorithms such as A*, dijkstra, and breadth-first-search
- a random maze generation algorithm
The algorithms are suitable for tilemaps, regular grids, as well as (non-regular) graphs.
npm install @amarillion/helixgraph
TypeScript definitions are included
Helixgraph's way of representing graphs is flexible, can be easily mixed with existing code, and can be used to represent all kinds of graphs: directed, undirected, sparse, dense, etc.
This section explains the use of three path finding algorithms: breadth first search, dijkstra, and A*
Mazes are a type of graph, helixgraph includes a set of algorithms for procedural generation of mazes (which can then be solved again them using the algorithm of chapter 2).