equal
deleted
inserted
replaced
244 * if the AyStar has been used before (though the normal main loop calls |
244 * if the AyStar has been used before (though the normal main loop calls |
245 * clear() automatically when the algorithm finishes |
245 * clear() automatically when the algorithm finishes |
246 */ |
246 */ |
247 void AyStarMain_AddStartNode(AyStar *aystar, AyStarNode *start_node) { |
247 void AyStarMain_AddStartNode(AyStar *aystar, AyStarNode *start_node) { |
248 #ifdef AYSTAR_DEBUG |
248 #ifdef AYSTAR_DEBUG |
249 printf("[AyStar] Starting A* Algorithm from node (%d, %d, %d)\n", GET_TILE_X(start_node->tile), GET_TILE_Y(start_node->tile), start_node->direction); |
249 printf("[AyStar] Starting A* Algorithm from node (%d, %d, %d)\n", |
|
250 TileX(start_node->tile), TileY(start_node->tile), start_node->direction); |
250 #endif |
251 #endif |
251 AyStarMain_OpenList_Add(aystar, NULL, start_node, 0, 0, 0); |
252 AyStarMain_OpenList_Add(aystar, NULL, start_node, 0, 0, 0); |
252 } |
253 } |
253 |
254 |
254 void init_AyStar(AyStar* aystar, Hash_HashProc hash, uint num_buckets) { |
255 void init_AyStar(AyStar* aystar, Hash_HashProc hash, uint num_buckets) { |