File: mapastar.cc

package info (click to toggle)
widelands 1:19+repack-3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 370,608 kB
  • ctags: 20,609
  • sloc: cpp: 108,404; ansic: 18,695; python: 5,155; sh: 487; xml: 460; makefile: 233
file content (53 lines) | stat: -rw-r--r-- 1,509 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
 * Copyright (C) 2011 by the Widelands Development Team
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 *
 */

#include "logic/mapastar.h"

#include "logic/map_objects/map_object.h"
#include "logic/path.h"

namespace Widelands {

/**
 * Recover a shortest path from one of the sources introduced by @ref MapAStar::push
 * to the given destination @p dest, which must have been discovered
 * in the A-star process already.
 */
void MapAStarBase::pathto(Coords dest, Path& path) const {
	path.end_ = dest;
	path.path_.clear();

	Coords cur = dest;
	for (;;) {
		const Pathfield& pf(pathfield(cur));

		assert(pf.cycle == pathfields->cycle);

		if (pf.backlink == IDLE)
			break;

		path.path_.push_back(pf.backlink);

		map.get_neighbour(cur, get_reverse_dir(pf.backlink), &cur);
	}

	path.start_ = cur;
}

}  // namespace Widelands