yap-6.3/packages/CLPBN/horus/BayesBall.h

#ifndef HORUS_BAYESBALL_H
#define HORUS_BAYESBALL_H

#include <vector>
#include <queue>
#include <list>
#include <map>

#include "FactorGraph.h"
#include "BayesBallGraph.h"
#include "Horus.h"

using namespace std;


struct ScheduleInfo
{
  ScheduleInfo (BBNode* n, bool vfp, bool vfc) : 
      node(n), visitedFromParent(vfp), visitedFromChild(vfc) { }

  BBNode*  node;
  bool     visitedFromParent;
  bool     visitedFromChild;
};


typedef queue<ScheduleInfo, list<ScheduleInfo>> Scheduling;


class BayesBall
{
  public:
   BayesBall (FactorGraph& fg) 
       : fg_(fg) , dag_(fg.getStructure())
   {
     dag_.clear();
   }

   FactorGraph* getMinimalFactorGraph (const VarIds&);

   static FactorGraph* getMinimalFactorGraph (FactorGraph& fg, VarIds vids)
   {
     BayesBall bb (fg);
     return bb.getMinimalFactorGraph (vids);
   }

  private:

    void constructGraph (FactorGraph* fg) const;

    void scheduleParents (const BBNode* n, Scheduling& sch) const;

    void scheduleChilds (const BBNode* n, Scheduling& sch) const;

    FactorGraph& fg_;

    BayesBallGraph& dag_;
};



inline void
BayesBall::scheduleParents (const BBNode* n, Scheduling& sch) const
{
  const vector<BBNode*>& ps = n->parents();
  for (vector<BBNode*>::const_iterator it = ps.begin(); 
      it != ps.end(); ++it) {
    sch.push (ScheduleInfo (*it, false, true));
  }
}



inline void
BayesBall::scheduleChilds (const BBNode* n, Scheduling& sch) const
{
  const vector<BBNode*>& cs = n->childs();
  for (vector<BBNode*>::const_iterator it = cs.begin();
      it != cs.end(); ++it) {
    sch.push (ScheduleInfo (*it, true, false));
  }
}

#endif // HORUS_BAYESBALL_H