blob: 5003f9bcfcafd1f4e0dfca374de553cc4bd4a6be (
plain)
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
|
// Copyright 2008, 2009 Brady J. Garvin
// This file is part of Covering Arrays by Simulated Annealing (CASA).
// CASA 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.
// CASA 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 CASA. If not, see <http://www.gnu.org/licenses/>.
#ifndef STATE_SPACE_H
#define STATE_SPACE_H
#include <set>
#include "search/Node.H"
// A description of a state space, namely the state interconnections and
// distances (for pathfinding rather than statefinding).
template<class STATE, class COST>class StateSpace {
public:
virtual ~StateSpace() {}
// Determine the distance incurred by starting at the given state.
virtual COST getTraveled(const STATE&start) const = 0;
// Determine the total distance traveled to reach state after taking the best
// known path reaching parent.
virtual COST getTraveled(const Node<STATE, COST>&parent, const STATE&state)
const = 0;
// Enumerate a fixed fraction of the children of state, rounding up.
virtual std::set<STATE>getChildren(const STATE&state, float proportion)
const = 0;
// Enumerate the children of state up to some limit.
virtual std::set<STATE>getChildren(const STATE&state, unsigned count)
const = 0;
};
#endif
|
