Inheritance diagram for Sudoku:
Public Member Functions | |
| const DiscreteKey & | dkey (size_t i, size_t j) const |
| return DiscreteKey for cell(i,j) More... | |
| Key | key (size_t i, size_t j) const |
| return Key for cell(i,j) More... | |
| void | printAssignment (DiscreteFactor::sharedValues assignment) const |
| Print readable form of assignment. More... | |
| void | printSolution () |
| solve and print solution More... | |
| Sudoku (size_t n,...) | |
| Constructor. More... | |
 Public Member Functions inherited from gtsam::CSP | |
| void | addAllDiff (const DiscreteKey &key1, const DiscreteKey &key2) |
| Add a binary AllDiff constraint. More... | |
| void | addAllDiff (const DiscreteKeys &dkeys) |
| Add a general AllDiff constraint. More... | |
| void | addSingleValue (const DiscreteKey &dkey, size_t value) |
| Add a unary constraint, allowing only a single value. More... | |
| sharedValues | optimalAssignment () const |
| Find the best total assignment - can be expensive. More... | |
| sharedValues | optimalAssignment (const Ordering &ordering) const |
| Find the best total assignment - can be expensive. More... | |
| void | runArcConsistency (size_t cardinality, size_t nrIterations=10, bool print=false) const |
| Public Member Functions inherited from gtsam::DiscreteFactorGraph | |
| template<class SOURCE > | |
| void | add (const DiscreteKey &j, SOURCE table) |
| template<class SOURCE > | |
| void | add (const DiscreteKey &j1, const DiscreteKey &j2, SOURCE table) |
| template<class SOURCE > | |
| void | add (const DiscreteKeys &keys, SOURCE table) |
| DiscreteFactorGraph () | |
| template<typename ITERATOR > | |
| DiscreteFactorGraph (ITERATOR firstFactor, ITERATOR lastFactor) | |
| template<class CONTAINER > | |
| DiscreteFactorGraph (const CONTAINER &factors) | |
| template<class DERIVEDFACTOR > | |
| DiscreteFactorGraph (const FactorGraph< DERIVEDFACTOR > &graph) | |
| KeySet | keys () const |
| double | operator() (const DiscreteFactor::Values &values) const |
| DiscreteFactor::sharedValues | optimize () const |
| void | print (const std::string &s="DiscreteFactorGraph", const KeyFormatter &formatter=DefaultKeyFormatter) const override |
| print More... | |
| DecisionTreeFactor | product () const |
| virtual | ~DiscreteFactorGraph () |
| Destructor. More... | |
| bool | equals (const This &fg, double tol=1e-9) const |
| Public Member Functions inherited from gtsam::FactorGraph< DiscreteFactor > | |
| virtual | ~FactorGraph ()=default |
| Default destructor. More... | |
| void | reserve (size_t size) |
| IsDerived< DERIVEDFACTOR > | push_back (boost::shared_ptr< DERIVEDFACTOR > factor) |
| Add a factor directly using a shared_ptr. More... | |
| IsDerived< DERIVEDFACTOR > | push_back (const DERIVEDFACTOR &factor) |
| IsDerived< DERIVEDFACTOR > | emplace_shared (Args &&...args) |
| Emplace a shared pointer to factor of given type. More... | |
| IsDerived< DERIVEDFACTOR > | add (boost::shared_ptr< DERIVEDFACTOR > factor) |
add is a synonym for push_back. More... | |
| std::enable_if< std::is_base_of< FactorType, DERIVEDFACTOR >::value, boost::assign::list_inserter< RefCallPushBack< This > > >::type | operator+= (boost::shared_ptr< DERIVEDFACTOR > factor) |
+= works well with boost::assign list inserter. More... | |
| HasDerivedElementType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
| HasDerivedValueType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
| Push back many factors with an iterator (factors are copied) More... | |
| HasDerivedElementType< CONTAINER > | push_back (const CONTAINER &container) |
| HasDerivedValueType< CONTAINER > | push_back (const CONTAINER &container) |
| Push back non-pointer objects in a container (factors are copied). More... | |
| void | add (const FACTOR_OR_CONTAINER &factorOrContainer) |
| boost::assign::list_inserter< CRefCallPushBack< This > > | operator+= (const FACTOR_OR_CONTAINER &factorOrContainer) |
| std::enable_if< std::is_base_of< This, typename CLIQUE::FactorGraphType >::value >::type | push_back (const BayesTree< CLIQUE > &bayesTree) |
| FactorIndices | add_factors (const CONTAINER &factors, bool useEmptySlots=false) |
| bool | equals (const This &fg, double tol=1e-9) const |
| size_t | size () const |
| bool | empty () const |
| const sharedFactor | at (size_t i) const |
| sharedFactor & | at (size_t i) |
| const sharedFactor | operator[] (size_t i) const |
| sharedFactor & | operator[] (size_t i) |
| const_iterator | begin () const |
| const_iterator | end () const |
| sharedFactor | front () const |
| sharedFactor | back () const |
| iterator | begin () |
| iterator | end () |
| void | resize (size_t size) |
| void | remove (size_t i) |
| void | replace (size_t index, sharedFactor factor) |
| iterator | erase (iterator item) |
| iterator | erase (iterator first, iterator last) |
| size_t | nrFactors () const |
| KeySet | keys () const |
| KeyVector | keyVector () const |
| bool | exists (size_t idx) const |
| Public Member Functions inherited from gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| boost::shared_ptr< BayesTreeType > | eliminateMultifrontal (OptionalOrderingType orderingType=boost::none, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesTreeType > | eliminateMultifrontal (const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesTreeType > | eliminateMultifrontal (const Ordering &ordering, const Eliminate &function, OptionalVariableIndex variableIndex, OptionalOrderingType orderingType) const |
| boost::shared_ptr< BayesTreeType > | eliminateMultifrontal (const Eliminate &function, OptionalVariableIndex variableIndex=boost::none, OptionalOrderingType orderingType=boost::none) const |
| std::pair< boost::shared_ptr< BayesTreeType >, boost::shared_ptr< FactorGraphType > > | eliminatePartialMultifrontal (const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| std::pair< boost::shared_ptr< BayesTreeType >, boost::shared_ptr< FactorGraphType > > | eliminatePartialMultifrontal (const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| std::pair< boost::shared_ptr< BayesNetType >, boost::shared_ptr< FactorGraphType > > | eliminatePartialSequential (const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| std::pair< boost::shared_ptr< BayesNetType >, boost::shared_ptr< FactorGraphType > > | eliminatePartialSequential (const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | eliminateSequential (OptionalOrderingType orderingType=boost::none, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | eliminateSequential (const Ordering &ordering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | eliminateSequential (const Ordering &ordering, const Eliminate &function, OptionalVariableIndex variableIndex, OptionalOrderingType orderingType) const |
| boost::shared_ptr< BayesNetType > | eliminateSequential (const Eliminate &function, OptionalVariableIndex variableIndex=boost::none, OptionalOrderingType orderingType=boost::none) const |
| boost::shared_ptr< FactorGraphType > | marginal (const KeyVector &variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | marginalMultifrontalBayesNet (boost::variant< const Ordering &, const KeyVector & > variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | marginalMultifrontalBayesNet (boost::variant< const Ordering &, const KeyVector & > variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesNetType > | marginalMultifrontalBayesNet (boost::variant< const Ordering &, const KeyVector & > variables, boost::none_t, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesTreeType > | marginalMultifrontalBayesTree (boost::variant< const Ordering &, const KeyVector & > variables, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesTreeType > | marginalMultifrontalBayesTree (boost::variant< const Ordering &, const KeyVector & > variables, const Ordering &marginalizedVariableOrdering, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
| boost::shared_ptr< BayesTreeType > | marginalMultifrontalBayesTree (boost::variant< const Ordering &, const KeyVector & > variables, boost::none_t, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const |
Private Types | |
| typedef std::pair< size_t, size_t > | IJ |
| discrete keys More... | |
Private Attributes | |
| std::map< IJ, DiscreteKey > | dkeys_ |
| size_t | n_ |
| sudoku size More... | |
Additional Inherited Members | |
| Public Types inherited from gtsam::CSP | |
| typedef KeyVector | Indices |
| typedef boost::shared_ptr< Values > | sharedValues |
| typedef Assignment< Key > | Values |
| Public Types inherited from gtsam::DiscreteFactorGraph | |
| typedef FactorGraph< DiscreteFactor > | Base |
| Typedef to base factor graph type. More... | |
| typedef EliminateableFactorGraph< This > | BaseEliminateable |
| Typedef to base elimination class. More... | |
| typedef KeyVector | Indices |
| typedef boost::shared_ptr< This > | shared_ptr |
| shared_ptr to this class More... | |
| typedef boost::shared_ptr< Values > | sharedValues |
| typedef DiscreteFactorGraph | This |
| Typedef to this class. More... | |
| typedef Assignment< Key > | Values |
| Public Types inherited from gtsam::FactorGraph< DiscreteFactor > | |
| typedef FastVector< sharedFactor >::const_iterator | const_iterator |
| typedef DiscreteFactor | FactorType |
| factor type More... | |
| typedef FastVector< sharedFactor >::iterator | iterator |
| typedef boost::shared_ptr< DiscreteFactor > | sharedFactor |
| Shared pointer to a factor. More... | |
| typedef sharedFactor | value_type |
| Public Types inherited from gtsam::EliminateableFactorGraph< DiscreteFactorGraph > | |
| typedef EliminationTraitsType::BayesNetType | BayesNetType |
| Bayes net type produced by sequential elimination. More... | |
| typedef EliminationTraitsType::BayesTreeType | BayesTreeType |
| Bayes tree type produced by multifrontal elimination. More... | |
| typedef EliminationTraitsType::ConditionalType | ConditionalType |
| Conditional type stored in the Bayes net produced by elimination. More... | |
| typedef boost::function< EliminationResult(const FactorGraphType &, const Ordering &)> | Eliminate |
| The function type that does a single dense elimination step on a subgraph. More... | |
| typedef std::pair< boost::shared_ptr< ConditionalType >, boost::shared_ptr< _FactorType > > | EliminationResult |
| typedef EliminationTraits< FactorGraphType > | EliminationTraitsType |
| Typedef to the specific EliminationTraits for this graph. More... | |
| typedef EliminationTraitsType::EliminationTreeType | EliminationTreeType |
| Elimination tree type that can do sequential elimination of this graph. More... | |
| typedef EliminationTraitsType::JunctionTreeType | JunctionTreeType |
| Junction tree type that can do multifrontal elimination of this graph. More... | |
| typedef boost::optional< Ordering::OrderingType > | OptionalOrderingType |
| Typedef for an optional ordering type. More... | |
| typedef boost::optional< const VariableIndex & > | OptionalVariableIndex |
| Typedef for an optional variable index as an argument to elimination functions. More... | |
| Protected Member Functions inherited from gtsam::FactorGraph< DiscreteFactor > | |
| FactorGraph () | |
| FactorGraph (ITERATOR firstFactor, ITERATOR lastFactor) | |
| FactorGraph (const CONTAINER &factors) | |
| Protected Attributes inherited from gtsam::FactorGraph< DiscreteFactor > | |
| FastVector< sharedFactor > | factors_ |
Detailed Description
Definition at line 21 of file testSudoku.cpp.
Member Typedef Documentation
|
private |
discrete keys
Definition at line 27 of file testSudoku.cpp.
Constructor & Destructor Documentation
|
inline |
Constructor.
Definition at line 43 of file testSudoku.cpp.
Member Function Documentation
|
inline |
return DiscreteKey for cell(i,j)
Definition at line 33 of file testSudoku.cpp.
return Key for cell(i,j)
Definition at line 38 of file testSudoku.cpp.
|
inline |
Print readable form of assignment.
Definition at line 97 of file testSudoku.cpp.
|
inline |
solve and print solution
Definition at line 108 of file testSudoku.cpp.
Member Data Documentation
|
private |
Definition at line 28 of file testSudoku.cpp.
|
private |
sudoku size
Definition at line 24 of file testSudoku.cpp.
The documentation for this class was generated from the following file: