This struct contains the node information. More...
#include <maze.h>
Data Fields | |
maze_point_t | coordinates |
X and Y coordinates of the node. | |
uint32_t | f |
F-value of the node. F = G + H. | |
uint32_t | g |
uint32_t | h |
bool | is_visited |
Indicates if the node has been visited before. | |
struct maze_grid_cell * | p_came_from |
struct maze_grid_cell * | p_next [4] |
This struct contains the node information.
uint32_t g |
G-value of the node. G = cost to move from the starting node to the current node.
uint32_t h |
H-value of the node. H = estimated cost to move from the current node to the end node aka heuristic.
struct maze_grid_cell* p_came_from |
Pointer to the node that the current node came from for the A* algorithm.
struct maze_grid_cell* p_next[4] |
Pointers to the next nodes. This is indexed by the direction enum.