relax.h

Go to the documentation of this file.

//
//    FreeLing - Open Source Language Analyzers
//
//    Copyright (C) 2004   TALP Research Center
//                         Universitat Politecnica de Catalunya
//
//    This library is free software; you can redistribute it and/or
//    modify it under the terms of the GNU General Public
//    License as published by the Free Software Foundation; either
//    version 3 of the License, or (at your option) any later version.
//
//    This library is distributed in the hope that it will be useful,
//    but WITHOUT ANY WARRANTY; without even the implied warranty of
//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
//    General Public License for more details.
//
//    You should have received a copy of the GNU General Public
//    License along with this library; if not, write to the Free Software
//    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
//    contact: Lluis Padro (padro@lsi.upc.es)
//             TALP Research Center
//             despatx C6.212 - Campus Nord UPC
//             08034 Barcelona.  SPAIN
//

#ifndef _RELAX
#define _RELAX

#include <list>
#include <vector>

// just declaring to break ciclic references
class constraint;


class problem : std::vector<std::list<double> > {
  friend class relax;
 public:
  problem(int);
  void add_label(int, double);
};



class label {
  friend class relax;
 protected:
  double weight[2];
  std::list<constraint> constraints;

 public:
  label();

};


class constraint : public std::vector<std::vector<double*> > {
 private:
  double compatibility;

 public:
  constraint(int);

  void set_compatibility(double);
  double get_compatibility() const;
};


class relax {
 private:
  std::vector<std::vector<label> > vars;
  int CURRENT, NEXT;
  int MaxIter;
  double ScaleFactor;
  double Epsilon;

  double NormalizeSupport(double) const;
  bool there_are_changes() const;

 public:
  relax(int, double, double);

  void reset(const problem &);
  void add_constraint (int, int, const std::list<std::list<std::pair<int,int> > > &, double);
  void solve();
  std::list<int> best_label(int) const;
};


#endif