Mercurial > fife-parpg

comparison engine/core/pathfinder/routepather/routepathersearch.h @ 0:4a0efb7baf70

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
* Datasets becomes the new trunk and retires after that :-)
author mvbarracuda@33b003aa-7bff-0310-803a-e67f0ece8222
date Sun, 29 Jun 2008 18:44:17 +0000
parents
children 90005975cdbb
comparison
equal deleted inserted replaced
-1:000000000000 0:4a0efb7baf70
1 /***************************************************************************
2 * Copyright (C) 2005-2008 by the FIFE team *
3 * http://www.fifengine.de *
4 * This file is part of FIFE. *
5 * *
6 * FIFE 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. *
10 * *
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. *
15 * *
16 * You should have received a copy of the GNU General Public License *
17 * along with this program; if not, write to the *
18 * Free Software Foundation, Inc., *
19 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA *
20 ***************************************************************************/
21
22 #ifndef FIFE_PATHFINDER_ROUTEPATHERSEARCH
23 #define FIFE_PATHFINDER_ROUTEPATHERSEARCH
24
25 // Standard C++ library includes
26
27 // 3rd party library includes
28
29 // FIFE includes
30 // These includes are split up in two parts, separated by one empty line
31 // First block: files included from the FIFE root src directory
32 // Second block: files included from the same folder
33 #include "pathfinder/search.h"
34 #include "util/structures/priorityqueue.h"
35
36 namespace FIFE {
37
38 class Map;
39 class SearchSpace;
40 class Heuristic;
41
42 /** RoutePatherSearch using A*
43 *
44 * For now this class uses offline A*, however eventually this will be switched over to RTA*.
45 */
46 class RoutePatherSearch : public Search {
47 public:
48 RoutePatherSearch(const int session_id, const Location& from, const Location& to, SearchSpace* searchSpace);
49
50 virtual void updateSearch();
51
52 virtual Path calcPath();
53 private:
54 //The class to use to calculate the heuristic value.
55 Heuristic* m_heuristic;
56 //The destination coordinate as an int.
57 int m_destCoordInt;
58 //The start coordinate as an int.
59 int m_startCoordInt;
60 //The next coordinate int to check out.
61 int m_next;
62 //The shortest path tree.
63 std::vector<int> m_spt;
64 //The search frontier.
65 std::vector<int> m_sf;
66 //A table to hold the costs.
67 std::vector<float> m_gCosts;
68 //priority queue to hold nodes on the sf in order.
69 PriorityQueue<int, float> m_sortedfrontier;
70 };
71
72 }
73
74 #endif