49#ifndef GUM_MARKOV_RANDOM_FIELD_H
50#define GUM_MARKOV_RANDOM_FIELD_H
87 template < GUM_Numeric GUM_SCALAR >
112 static MarkovRandomField< GUM_SCALAR > fastPrototype(std::string_view dotlike, Size domainSize);
113 static MarkovRandomField< GUM_SCALAR > fastPrototype(std::string_view dotlike,
114 std::string_view domain =
"[2]");
121 static MarkovRandomField< GUM_SCALAR > fromBN(
const BayesNet< GUM_SCALAR >& bn);
138 explicit MarkovRandomField(std::string_view name);
143 ~MarkovRandomField()
override;
148 MarkovRandomField(
const MarkovRandomField< GUM_SCALAR >& source);
162 MarkovRandomField< GUM_SCALAR >& operator=(
const MarkovRandomField< GUM_SCALAR >& source);
170 MarkovRandomField< GUM_SCALAR >& operator=(MarkovRandomField< GUM_SCALAR >&& source)
noexcept;
185 const Tensor< GUM_SCALAR >& factor(
const NodeSet& varIds)
const final;
187 virtual const Tensor< GUM_SCALAR >&
188 factor(
const std::vector< std::string >& varnames)
const final;
195 const NodeSet& smallestFactorFromNode(NodeId node)
const final;
201 const FactorTable< GUM_SCALAR >& factors() const final;
217 NodeId add(const DiscreteVariable& var);
237 NodeId add(std::string_view fast_description,
unsigned int default_nbrmod = 2);
256 NodeId add(const DiscreteVariable& var, NodeId
id);
273 void erase(NodeId varId);
278 void erase(std::string_view name);
290 void erase(const DiscreteVariable& var);
307 const DiscreteVariable& variable(std::string_view name) const;
318 void changeVariableName(NodeId
id, std::string_view new_name);
323 void changeVariableName(std::string_view name, std::string_view new_name);
335 void changeVariableLabel(NodeId
id, std::string_view old_label, std::string_view new_label);
340 void changeVariableLabel(std::string_view name,
341 std::string_view old_label,
342 std::string_view new_label);
359 const Tensor< GUM_SCALAR >& addFactor(const std::vector< std::
string >& varnames);
371 const Tensor< GUM_SCALAR >& addFactor(const NodeSet& vars);
382 const Tensor< GUM_SCALAR >& addFactor(const Tensor< GUM_SCALAR >& factor);
390 void eraseFactor(const NodeSet& vars);
392 void eraseFactor(const std::vector< std::
string >& varnames);
397 void generateFactors() const;
400 void generateFactor(const NodeSet& vars) const;
404 void beginTopologyTransformation();
406 void endTopologyTransformation();
409 bool _topologyTransformationInProgress_;
412 void _clearFactors_();
415 void _copyFactors_(const MarkovRandomField< GUM_SCALAR >& source);
418 void _rebuildGraph_();
421 FactorTable< GUM_SCALAR > _factors_;
423 Tensor< GUM_SCALAR >& _addFactor_(const std::vector< NodeId >& ordered_nodes);
425 void _eraseFactor_(const NodeSet& vars);
428 using IMarkovRandomField< GUM_SCALAR >::graph;
429 using IMarkovRandomField< GUM_SCALAR >::size;
430 using IMarkovRandomField< GUM_SCALAR >::nodes;
431 using IMarkovRandomField< GUM_SCALAR >::log10DomainSize;
432 using DiscreteGraphicalModel::idFromName;
433 using DiscreteGraphicalModel::variableNodeMap;
434 using DiscreteGraphicalModel::variable;
435 using DiscreteGraphicalModel::nodeId;
436 using DiscreteGraphicalModel::variableFromName;
440 template < GUM_Numeric GUM_SCALAR >
441 std::ostream& operator<<(std::ostream& output, const MarkovRandomField< GUM_SCALAR >& bn);
444#ifndef GUM_NO_EXTERN_TEMPLATE_CLASS
446 extern template class MarkovRandomField< double >;
Class representing Bayesian networks.
Class representing Markov random fields.
Template implementation of BN/MarkovRandomField.h class.
Class representing the minimal interface for Markov random field.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities