* @brief return a node for (dx,dy) on the frontier, or NULL if not found */
| 263 | * @brief return a node for (dx,dy) on the frontier, or NULL if not found |
| 264 | */ |
| 265 | PATHNODE *path_get_node1(int dx, int dy) |
| 266 | { |
| 267 | PATHNODE *result = path_2_nodes->NextNode; |
| 268 | while (result != NULL && (result->x != dx || result->y != dy)) |
| 269 | result = result->NextNode; |
| 270 | return result; |
| 271 | } |
| 272 | |
| 273 | /** |
| 274 | * @brief return a node for (dx,dy) if it was visited, or NULL if not found |