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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
// Copyright (C) 2009 Ben Asselstine
//
// 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 3 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 Library 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.
#pragma once
#ifndef ROADPATH_CALCULATOR_H
#define ROADPATH_CALCULATOR_H
#include <gtkmm.h>
#include "vector.h"
class Path;
class Stack;
class PathCalculator;
//! An object that calculates shortest paths on a weighted grid.
/**
*/
class RoadPathCalculator
{
public:
//! Default constructor.
RoadPathCalculator(Vector<int> starting_point, bool fly = false);
//! Copy constructor.
RoadPathCalculator(const RoadPathCalculator&);
//! Destructor.
~RoadPathCalculator();
// Get Methods
Vector<int> getPos() const;
// Methods that operate on the class data and modify the class.
//! Return a calculated path from the starting point to the given position.
Path* calculate(Vector<int> dest);
Path* calculate(Vector<int> dest, guint &moves);
guint32 calculate_moves(Vector<int> dest);
void regenerate();
private:
// DATA
//! The stack with the movement characteristics to make the road with.
Stack *stack;
//! The path calculator that does the hard work.
PathCalculator *path_calculator;
};
#endif
|
