gastar is fork of graflib library (https://github.com/mashingan/graflib) which implemented in Nim. gastar specifically implements A* path finding that can be customizable like graflib. While graflib offer more integrated graph solution with additional edges and vertices, gastar only gives solution of path finding search. In order gastar can search the solution, any graph instance will need to implement method - Neighbors, which acts as edges connector for each Node. - Cost, between two Nodes - Distance, between two Nodes