From 76729f9670ba63a9146079b081bdb5b5ae0bbd3d Mon Sep 17 00:00:00 2001 From: Kenny Ballou Date: Fri, 28 Feb 2020 15:36:09 -0700 Subject: CASA fork: initial commit Snapshot from http://cse.unl.edu/~citportal/. --- casa/search/Guide.H | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 casa/search/Guide.H (limited to 'casa/search/Guide.H') diff --git a/casa/search/Guide.H b/casa/search/Guide.H new file mode 100644 index 0000000..797d39f --- /dev/null +++ b/casa/search/Guide.H @@ -0,0 +1,34 @@ +// 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 . + + +#ifndef GUIDE_H +#define GUIDE_H + +// Decides the order in which states are explored. Usual policies include +// visiting the heuristically best states first, visiting states whose distance +// from the start state added to the heuristic is minimal, visiting states +// randomly, etc. There is provision to treat start states specially. + +templateclass Guide { +public: + virtual ~Guide() {} + virtual COST rankStart(const Node&start) const = 0; + virtual COST rank(const Node&node) const = 0; +}; + +#endif -- cgit v1.2.1