Logo Search packages:      
Sourcecode: inkscape version File versions  Download package


 * \brief Solve an instance of the "Variable Placement with Separation
 * Constraints" problem.
 * Authors:
 *   Tim Dwyer <tgdwyer@gmail.com>
 * Copyright (C) 2005 Authors
 * Released under GNU LGPL.  Read the file 'COPYING' for more information.

// TODO: Really, we should have three classes: VPSC, IncrementalVPSC and
// StaticVPSC, where the latter two inherit from VPSC.  StaticVPSC would be
// the equivalent of what is currently VPSC.
// Also, a lot of the code specific to one or other of these concrete
// implementations should be moved from Block and Blocks: e.g. mergeLeft etc.

#include <vector>

namespace vpsc {
class Variable;
class Constraint;
class Blocks;

 * Variable Placement with Separation Constraints problem instance
00033 class Solver {
      virtual void satisfy();
      virtual void solve();

      Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
      virtual ~Solver();
      Constraint** getConstraints(unsigned &m) { m=this->m; return cs; }
      const Variable* const * getVariables(unsigned &n) { n=this->n; return vs; }
      Blocks *bs;
      unsigned m;
      Constraint **cs;
      unsigned n;
      const Variable* const *vs;
      void printBlocks();
      void refine();
      bool constraintGraphIsCyclic(const unsigned n, Variable* const vs[]);
      bool blockGraphIsCyclic();

class IncSolver : public Solver {
      unsigned splitCnt;
      void satisfy();
      void solve();
      void moveBlocks();
      void splitBlocks();
      IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
      typedef std::vector<Constraint*> ConstraintList;
      ConstraintList inactive;
      Constraint* mostViolated(ConstraintList &l);

Generated by  Doxygen 1.6.0   Back to index