Generated on Mon Jun 23 17:18:29 2008 for ell-2.3.0 by doxygen 1.5.1

ell::WalkAdaptive Class Reference

#include <Walk.hh>

Inheritance diagram for ell::WalkAdaptive:

Inheritance graph
[legend]

Detailed Description

WalkAdaptive defines:

Author:
: Hannes Kochniß, Daniel Maticzka, Martin Mann

Definition at line 89 of file Walk.hh.

Public Types

enum  NeighborGenType { SUCCESSIVE, RANDOM }

Public Member Functions

virtual StateCollectorwalk (const State *const start, StateCollector *const scWalk, StateCollector *const scRejected=NULL) const
 WalkAdaptive (const NeighborGenType ngt, const bool isDegenerate=false)
virtual ~WalkAdaptive ()

Static Public Member Functions

static StateCollectorwalk (const State *const start, StateCollector *const scWalk, const NeighborGenerator *const ng, const StateAcceptor *const sa, const WalkAbortionCriterion *const wac, StateCollector *scRejected=NULL)
static StateCollectorwalkAdaptive (const State *const start, StateCollector *const scWalk, const NeighborGenType ngt, StateCollector *const scRejected=NULL, const bool isDegenerate=false)

Protected Attributes

const bool isDeg
const NeighborGenType t


Member Enumeration Documentation

defines the kinds of Adaptive Walks: with random neighbor or succesive neighborgeneration

Enumerator:
SUCCESSIVE 
RANDOM 

Definition at line 93 of file Walk.hh.


Constructor & Destructor Documentation

ell::WalkAdaptive::WalkAdaptive ( const NeighborGenType  ngt,
const bool  isDegenerate = false 
)

constructor for a WalkAdaptive object, takes the type of walk

Parameters:
ngt the type of the neighbor generator to use
isDegenerate whether or not a degenerate landscape is in use and a 'lesser energy' check is not sufficient and the lexicographical order of the compressed representation is used as a tiebreaker (equal E).

Definition at line 71 of file Walk.cc.

virtual ell::WalkAdaptive::~WalkAdaptive (  )  [inline, virtual]

virtual destructor

Definition at line 107 of file Walk.hh.


Member Function Documentation

StateCollector * ell::Walk::walk ( const State *const  start,
StateCollector *const  scWalk,
const NeighborGenerator *const  ng,
const StateAcceptor *const  sa,
const WalkAbortionCriterion *const  wac,
StateCollector scRejected = NULL 
) [static, inherited]

This function implements a generic walk starting from State start. The properties of this search are defined by the implementations of NeighborhoodGenerator, StateAcceptor WalkAbortionCriterion and StateCollector.

Parameters:
start the begin of the walk
scWalk the StateCollector each step of the walk is added to
ng the NeighborGenerator used to get the neighbor list of the last walk State to generate the next possible steps
sa the StateAcceptor that decides if a step is accepted or rejected
wac the walk abortion criterion that decides if the end of the walk has been reached or a further step is to do
scRejected the StateCollector each rejected possible step is added to
Returns:
the modified scWalk StateCollector

Definition at line 13 of file Walk.cc.

StateCollector * ell::WalkAdaptive::walk ( const State *const  start,
StateCollector *const  scWalk,
StateCollector *const  scRejected = NULL 
) const [virtual]

pure virtual function, s is start state

Parameters:
start the begin of the walk
scWalk the StateCollector each step of the walk is added to
scRejected the StateCollector each rejected possible step is added to
Returns:
the modified scWalk StateCollector

Implements ell::Walk.

Definition at line 125 of file Walk.cc.

StateCollector * ell::WalkAdaptive::walkAdaptive ( const State *const  start,
StateCollector *const  scWalk,
const NeighborGenType  ngt,
StateCollector *const  scRejected = NULL,
const bool  isDegenerate = false 
) [static]

This static function implements an adaptive walk starting from State start by executing Walk::walk.

Parameters:
start the begin of the walk
scWalk the StateCollector each step of the walk is added to
ngt the type of the neighbor generator to use
scRejected the StateCollector each rejected possible step is added to
isDegenerate whether or not a degenerate landscape is in use and a 'lesser energy' check is not sufficient and the lexicographical order of the compressed representation is used as a tiebreaker (equal E).
Returns:
the modified scWalk StateCollector

Definition at line 76 of file Walk.cc.


Field Documentation

const bool ell::WalkAdaptive::isDeg [protected]

whether or not a degenerate landscape is in use and a 'lesser energy' check is not sufficient and the lexicographical order of the compressed representation is used as a tiebreaker (equal E).

Definition at line 149 of file Walk.hh.

WalkAdaptive object stores which kind neighbor generation is used.

Definition at line 143 of file Walk.hh.


The documentation for this class was generated from the following files: