qmonomial.h

#ifndef QMONOMIAL_H
#define QMONOMIAL_H

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/graph_traits.hpp>
#include <scil/core/monomial.h>
#include <scil/core/qelement.h>

namespace SCIL {

using namespace boost;

template <typename Graph>
class qmonomial : public qelement<Graph>{
      private:
         monomial* m;

      public:
         //the trivial default constructor, everything undefined
         qmonomial() : m(NULL){
            this->l = NULL;
            this->r = NULL;
            this->maximal = true;
            this->basic = false;
            this->sg_node = NULL;
            this->checkGraphConcepts();
         }

         //construct a qmonomial from a monomial
         qmonomial(monomial* mo)
            : m(mo) {
               this->l = NULL;
               this->r = NULL;
               this->maximal = true;
               this->basic = false;
               this->sg_node = NULL;
               this->checkGraphConcepts();
            }

         //return the monomial itself
         monomial* getMonomial() const {
            return m;
         }

         //set the monomial
         void setMonomial(monomial* mo) {
            m = mo;
            return;
         }

         row get_linVar();

         //the linear transformations
         virtual row trans();
         virtual row transLeft();
         virtual row transRight();

         //add the constraints coupling the monomial to its decomposition
         virtual void linearize(ILP_Problem& IP);

         //output the variables making up the monomial (if QUADINST_DEBUG)
         virtual void printName();

   };

}
#include "../../../src/core/qmonomial.cc"
#endif

---