This repository has been archived on 2023-08-20. You can view files and clone it, but cannot push or open issues or pull requests.
yap-6.3/packages/CLPBN/horus/FactorGraph.h

151 lines
3.1 KiB
C
Raw Normal View History

2012-05-23 14:56:01 +01:00
#ifndef HORUS_FACTORGRAPH_H
#define HORUS_FACTORGRAPH_H
#include <vector>
#include "Factor.h"
2012-06-19 14:32:12 +01:00
#include "BayesBallGraph.h"
2012-05-23 14:56:01 +01:00
#include "Horus.h"
using namespace std;
class FacNode;
class VarNode : public Var
{
public:
VarNode (VarId varId, unsigned nrStates,
int evidence = Constants::NO_EVIDENCE)
: Var (varId, nrStates, evidence) { }
VarNode (const Var* v) : Var (v) { }
void addNeighbor (FacNode* fn) { neighs_.push_back (fn); }
const FacNodes& neighbors (void) const { return neighs_; }
private:
DISALLOW_COPY_AND_ASSIGN (VarNode);
FacNodes neighs_;
};
2012-05-28 17:00:46 +01:00
2012-05-23 14:56:01 +01:00
class FacNode
{
public:
FacNode (const Factor& f) : factor_(f), index_(-1) { }
const Factor& factor (void) const { return factor_; }
Factor& factor (void) { return factor_; }
void addNeighbor (VarNode* vn) { neighs_.push_back (vn); }
const VarNodes& neighbors (void) const { return neighs_; }
2012-05-24 22:55:20 +01:00
size_t getIndex (void) const { return index_; }
2012-05-23 14:56:01 +01:00
2012-05-24 22:55:20 +01:00
void setIndex (size_t index) { index_ = index; }
2012-05-23 14:56:01 +01:00
string getLabel (void) { return factor_.getLabel(); }
private:
DISALLOW_COPY_AND_ASSIGN (FacNode);
VarNodes neighs_;
Factor factor_;
2012-05-24 22:55:20 +01:00
size_t index_;
2012-05-23 14:56:01 +01:00
};
class FactorGraph
{
public:
FactorGraph (void) : bayesFactors_(false) { }
2012-05-23 14:56:01 +01:00
FactorGraph (const FactorGraph&);
~FactorGraph (void);
const VarNodes& varNodes (void) const { return varNodes_; }
const FacNodes& facNodes (void) const { return facNodes_; }
void setFactorsAsBayesian (void) { bayesFactors_ = true; }
2012-05-23 14:56:01 +01:00
bool bayesianFactors (void) const { return bayesFactors_ ; }
2012-05-23 14:56:01 +01:00
2012-05-24 22:55:20 +01:00
size_t nrVarNodes (void) const { return varNodes_.size(); }
2012-05-23 14:56:01 +01:00
2012-05-24 22:55:20 +01:00
size_t nrFacNodes (void) const { return facNodes_.size(); }
2012-05-23 14:56:01 +01:00
VarNode* getVarNode (VarId vid) const
{
VarMap::const_iterator it = varMap_.find (vid);
return it != varMap_.end() ? it->second : 0;
}
void readFromUaiFormat (const char*);
void readFromLibDaiFormat (const char*);
void addFactor (const Factor& factor);
void addVarNode (VarNode*);
void addFacNode (FacNode*);
void addEdge (VarNode*, FacNode*);
bool isTree (void) const;
2012-06-19 14:32:12 +01:00
BayesBallGraph& getStructure (void);
2012-05-23 14:56:01 +01:00
void print (void) const;
void exportToGraphViz (const char*) const;
void exportToUaiFormat (const char*) const;
void exportToLibDaiFormat (const char*) const;
private:
// DISALLOW_COPY_AND_ASSIGN (FactorGraph);
void ignoreLines (std::ifstream&) const;
bool containsCycle (void) const;
bool containsCycle (const VarNode*, const FacNode*,
vector<bool>&, vector<bool>&) const;
bool containsCycle (const FacNode*, const VarNode*,
vector<bool>&, vector<bool>&) const;
VarNodes varNodes_;
FacNodes facNodes_;
2012-06-19 14:32:12 +01:00
BayesBallGraph structure_;
bool bayesFactors_;
2012-05-23 14:56:01 +01:00
typedef unordered_map<unsigned, VarNode*> VarMap;
VarMap varMap_;
};
2012-05-28 17:00:46 +01:00
struct sortByVarId
{
bool operator()(VarNode* vn1, VarNode* vn2) {
return vn1->varId() < vn2->varId();
}
};
2012-05-23 14:56:01 +01:00
#endif // HORUS_FACTORGRAPH_H