10#include <tracking/trackFindingCDC/findlets/base/Findlet.h>
12#include <tracking/trackFindingCDC/utilities/WeightedRelation.h>
13#include <tracking/trackFindingCDC/numerics/WithWeight.h>
15#include <tracking/trackFindingCDC/ca/CellularAutomaton.h>
25 class ModuleParamList;
36 template <
class AState,
class AStateRejecter,
class AResult>
56 void apply(
const std::vector<AState>& seededStates,
57 std::vector<AState>& hitStates,
59 std::vector<AResult>& results)
final;
65 std::vector<AResult>& results);
The Module parameter list class.
Implements the weighted cellular automaton algorithm.
Interface for a minimal algorithm part that wants to expose some parameters to a module.
Type for two related objects with a weight.
A mixin class to attach a weight to an object.
Findlet for constructing result paths out of a list of states, which are connected with weighted rela...
AStateRejecter m_stateRejecter
State rejecter to decide which available continuations should be traversed next.
bool m_param_endEarly
Parameter: Make it possible to have all subresults in the end results vector.
TrackFindingCDC::CellularAutomaton< AState > m_automaton
Findlet for adding a recursion cell state to the states.
void traverseTree(std::vector< TrackFindingCDC::WithWeight< const AState * > > &path, const std::vector< TrackFindingCDC::WeightedRelation< AState > > &relations, std::vector< AResult > &results)
Implementation of the traverseTree function.
void apply(const std::vector< AState > &seededStates, std::vector< AState > &hitStates, const std::vector< TrackFindingCDC::WeightedRelation< AState > > &relations, std::vector< AResult > &results) final
Main function of this findlet: traverse a tree starting from a given seed states.
void exposeParameters(ModuleParamList *moduleParamList, const std::string &prefix) final
Expose the parameters of the subfindlet.
TreeSearcher()
Construct this findlet and add the subfindlet as listener.
Abstract base class for different kinds of events.