2 * A* Search - A search library used in Empire to determine paths between
4 * Copyright (C) 1990-1998 Phil Lapsley
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
26 static void as_free_queue(struct as_queue *queue);
29 * Free any dynamically allocated data stored in the as_data structure.
32 as_reset(struct as_data *adp)
34 as_free_queue(adp->head);
36 as_free_queue(adp->tried);
38 as_free_queue(adp->subsumed);
41 as_free_path(adp->path);
46 * Free a queue (either the main, subsumed, or tried).
49 as_free_queue(struct as_queue *queue)
51 struct as_queue *qp, *qp2;
53 for (qp = queue; qp; qp = qp2) {
64 as_free_path(struct as_path *pp)
68 for (; pp; pp = pp2) {
75 * Delete the as_data structure (which includes freeing its data).
78 as_delete(struct as_data *adp)
81 free(adp->neighbor_coords);
82 free(adp->neighbor_nodes);