AIToolbox
A library that offers tools for AI problem solving.
AIToolbox::Factored::Bandit::MakeGraph< Maximizer > Struct Template Reference

This class is the public interface for initializing the graph in generic code that uses the maximizers. More...

#include <AIToolbox/Factored/Bandit/Algorithms/Utils/GraphUtils.hpp>

Public Member Functions

template<typename Data , typename... Args>
auto operator() (const Data &d, Args &&...args)
 

Detailed Description

template<typename Maximizer>
struct AIToolbox::Factored::Bandit::MakeGraph< Maximizer >

This class is the public interface for initializing the graph in generic code that uses the maximizers.

This functor creates a new graph that has the correct factor structure, given the input data, to be accepted by the specified Maximizer type.

Note that the graph, after being constructed, will not contain any data. Only the structure is initialized. To update the data contained by the graph, one must use the UpdateGraph functor.

A graph will in general only need to be constructed once, but can be updated infinitely. With some Maximizers this can save a lot of work.

Template Parameters
MaximizerThe type of the maximizer to construct a graph for.

Member Function Documentation

◆ operator()()

template<typename Maximizer >
template<typename Data , typename... Args>
auto AIToolbox::Factored::Bandit::MakeGraph< Maximizer >::operator() ( const Data &  d,
Args &&...  args 
)
inline

The documentation for this struct was generated from the following file: