gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/contribs/graph/doxygen.hh

@@ -0,0 +1,132 @@
+
+/*
+ *  Main authors:
+ *     Gr�goire Dooms <dooms@info.ucl.ac.be>
+ *
+ *  Copyright:
+ *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
+ *
+ *  Last modified:
+ *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
+ *     $Revision: 271 $
+ *
+ *  This file is part of CP(Graph)
+ *
+ *  See the file "contribs/graph/LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+
+/*
+ * No code, just contains the group definitions of the
+ * Doxygen-generated documentation
+ */
+
+/**
+ * \defgroup TaskProp Programming propagators for graph constraints
+ */
+
+/**
+ * \defgroup TaskPropViews Graph views used for programming propagators
+ * \ingroup TaskProp
+ *
+ * Graph constraints are posted on graph views ( OutAdjSetsGraphViews and
+ * NodeArcSetsGraphViews ). These views provide reflection methods to consult
+ * the current state of the domain of the variable(view). Among these
+ * reflection methods, you can find iteration methods which return an iterator
+ * over one of the bounds of the graph domain.
+ * 
+ * The views also provide basic and iterator tells for updating the domains.
+ * These methods return a ModEvent, a modification event which indicates which
+ * part of the domain was changed. These tells must be surrounded by the
+ * GECODE_ME_CHECK macro which returns from the propagator as soon as the space
+ * is failed as a failed space cannot be used in any later tells.
+ * 
+ */
+
+/**
+ * \defgroup TaskPropIter Additional iteration for graph constraints.
+ * \ingroup TaskProp
+ *
+ * In addition to the iterator reflection and tells provided by the views,
+ * generic iteration functions are provided. These functions take one or two
+ * graphs and scan their domains. A visitor object is passed as an argument and
+ * its callback functions called accordingly. For instance, with
+ * scanTwoGraphsCompleteNodeArcs, An node iterator is passed as argument. The
+ * function then scans all possible arcs build using couple of nodes in that
+ * iterator. A method of the visitor is called according to the
+ * presence/absence of this arc in the domains of two graph views. The possible
+ * states are None, Lub, and Glb if the arc (resp.) cannot , can, and must be
+ * part of the graph. The methods are named after the state of the arc in both
+ * graph domains e.g NoneNone or LubGlb. 
+ */
+
+/**
+ * \defgroup TaskPropGraph Graph data-structures for graph algorithm in propagators and branchings
+ * \ingroup TaskProp
+ *
+ * The CP(Graph) framework also provides the BoundsGraphs class.
+ * This class provides a graph data-structure for  both bounds of the graph
+ * domain. This allows to easily use graph algorithms in a graph propagator.
+ *
+ * A propagator defines a class inheriting from BoundsGraphs. In that children
+ * class, propagation steps are implemented by using graph algorithms. Then
+ * the propagate method of the Propagator calls these methods on an instance
+ * of the BoundsGraphs class. The process is examplified in the path
+ * constraint.
+ *
+ * The Boost Graph Library http://www.boost.org/libs/graph/ was chosen for its
+ * genericity, adaptability and number of available graph algorihtms.  The
+ * graph members of the BoundsGraphs class are encoding the bounds of the graph
+ * domain. They have a boost graph interface. 
+ */
+
+/** \defgroup TaskModel Modelling problems involving graph variables and
+ * constraints.
+ *
+ * In Gecode, Var is used for modelling, View for propagators and branching and
+ * Imp for the underlying implementations.  CP(Graph) uses graph views for all
+ * of these tasks. This means the graph views must be used with great caution.
+ * When the tells are used in modelling, they must be surrounded by a check for
+ * Space failure.  
+ *
+ * Two constraints specific to graphs are currently available: the complement constraint 
+ * and two path constraints.  Constraints are posted on graph views using a function e.g. path and complement.
+ * 
+ * The two set-based graph views currently available allow you to post set constraints on the underlying set variables.
+ * For instance if you wish to constrain the out-degree of node 4 to be 3, you
+ * can use the OutAdjSetsGraphView g and post the cardinality set constraint on
+ * g.outN[4]: cardinality(this, g.outN[4], 3, g.outN[4].cardMax());
+ * 
+ * Other graph specific constraints are under investigation. If you wish to
+ * design and implement new ones, please contact Gr�goire Dooms at
+ * dooms@info.ucl.ac.be to avoid duplicate work. 
+ */
+
+/** \defgroup TaskModelBranch Programming search heuristics for graph problems.
+ * \ingroup TaskModel
+ * 
+ * UnaryGraphBranching, a class inheriting from Branching is provided with
+ * CP(Graph). This class allows to define search heuristics which perform a
+ * binary choice of inclusion or exclusion of a node or arc from a single graph
+ * view.
+ *
+ * It uses a BoundsGraphs::branch method  which can use graph algorithms to
+ * decide on which node or arc to choose.  This branch method must return a
+ * BranchingDesc a description of the branching decision. Two classes are
+ * provided for implementing branching Description for the UnaryGraphBranching:
+ * GraphBDSingle and GraphBDMultiple. GraphBDSingle should be used if your
+ * search heuristic always chooses arcs or always chooses nodes to branch on.
+ * If the search tree interleaves choices about the nodes and choices about the
+ * arcs, then GraphBDMultiple should be used. See CPGraphSimplePathHeur and
+ * PathHeurBoundsG for examples.
+ */
+
+/** \defgroup Examples Examples/Tests
+ * 
+ * Some Examples or tests of the constraints and views are provided too. They
+ * are implemented by inheriting from the Examples class.
+ */
+

data/ext/gecode-1.3.1/contribs/graph/examples/cpgraph-basic.cc

@@ -0,0 +1,94 @@
+
+/*
+ *  Main authors:
+ *     Gr�goire Dooms <dooms@info.ucl.ac.be>
+ *
+ *  Copyright:
+ *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
+ *
+ *  Last modified:
+ *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
+ *     $Revision: 271 $
+ *
+ *  This file is part of CP(Graph)
+ *
+ *  See the file "contribs/graph/LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/support.hh"
+#include "graphutils.icc"
+#include "graph.hh"
+using namespace Gecode::Graph;
+/** \brief Most basic example possible for OutAdjSetsGraphView
+ *
+ * instantiate the View and distribute in a naive way.
+ * \ingroup Examples
+ */
+class CPGraphBasic: public Example {
+        private:
+                OutAdjSetsGraphView g1;
+        public: 
+                /// Constructor with unused options
+                CPGraphBasic(const Options& opt): g1(this,loadGraph("g1.txt")){
+                        cout << g1 << endl;
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphBasic(bool share, CPGraphBasic& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphBasic(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << "\tg1 = " << g1 << std::endl;
+                        }
+};
+/** \brief Most basic example possible for NodeArcSetsGraphView
+ *
+ * instantiate the View and distribute in a naive way.
+ * \ingroup Examples
+ */
+class CPGraphBasic2vars: public Example {
+        private:
+                NodeArcSetsGraphView g1;
+        public: 
+                /// Constructor with unused options
+                CPGraphBasic2vars(const Options& opt): g1(this,new ArcNode(loadGraph("g1.txt").second),loadGraph("g1.txt")){
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphBasic2vars(bool share, CPGraphBasic2vars& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphBasic2vars(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << "\tg1 = " << g1 << std::endl;
+                        }
+};
+int
+main(int argc, char** argv) {
+  Options opt("CPGraphBasic");
+  opt.icl        = ICL_DOM;
+  opt.solutions        = 0;
+  opt.parse(argc,argv);
+  if (opt.size == 2){
+          Example::run<CPGraphBasic2vars,DFS>(opt);
+  }else{
+          Example::run<CPGraphBasic,DFS>(opt);
+  }
+  return 0;
+}

data/ext/gecode-1.3.1/contribs/graph/examples/cpgraph-complement.cc

@@ -0,0 +1,104 @@
+
+/*
+ *  Main authors:
+ *     Gr�goire Dooms <dooms@info.ucl.ac.be>
+ *
+ *  Copyright:
+ *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
+ *
+ *  Last modified:
+ *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
+ *     $Revision: 271 $
+ *
+ *  This file is part of CP(Graph)
+ *
+ *  See the file "contribs/graph/LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/support.hh"
+#include "graphutils.icc"
+#include "graph.hh"
+using namespace Gecode::Graph;
+
+/** \brief Example to test the Complement constraint with OutAdjSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphComplement: public Example {
+        private:
+                OutAdjSetsGraphView g1;
+                OutAdjSetsGraphView g2;
+        public: 
+                /// Constructor with unused options
+                CPGraphComplement(const Options& opt): g1(this,loadGraph("g1.txt")), g2(this,loadGraph("g1.txt").first.size()){
+                        complement(this,g1,g2);
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphComplement(bool share, CPGraphComplement& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                        g2.update(this, share, s.g2);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphComplement(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                                std::cout << "g1 = " << g1 << std::endl;
+                                std::cout << "g2 = " << g2 << std::endl;
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                        }
+};
+
+/** \brief Example to test the Complement constraint with NodeArcSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphComplement2vars: public Example {
+        private:
+                ArcNode *an ; //used for member init  
+                NodeArcSetsGraphView g1; 
+                NodeArcSetsGraphView g2;
+        public: 
+                /// Constructor with unused options
+                CPGraphComplement2vars(const Options& opt): an(new ArcNode(loadGraph("g1.txt").first.size())), g1(this,an,loadGraph("g1.txt")), g2(this,an,loadGraph("g1.txt").first.size()) {
+                        complement(this,g1,g2);
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphComplement2vars(bool share, CPGraphComplement2vars& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                        g2.update(this, share, s.g2);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphComplement2vars(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                                std::cout << "g1 = " << g1 << std::endl;
+                                std::cout << "g2 = " << g2 << std::endl;
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                        }
+};
+int
+main(int argc, char** argv) {
+  Options opt("CPGraphComplement");
+  opt.icl        = ICL_DOM;
+  opt.solutions        = 0;
+  opt.parse(argc,argv);
+  if (opt.size == 2){
+          Example::run<CPGraphComplement2vars,DFS>(opt);
+  }else{
+          Example::run<CPGraphComplement,DFS>(opt);
+  }
+  return 0;
+}

data/ext/gecode-1.3.1/contribs/graph/examples/cpgraph-instUB.cc

@@ -0,0 +1,105 @@
+
+/*
+ *  Main authors:
+ *     Gr�goire Dooms <dooms@info.ucl.ac.be>
+ *
+ *  Copyright:
+ *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
+ *
+ *  Last modified:
+ *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
+ *     $Revision: 271 $
+ *
+ *  This file is part of CP(Graph)
+ *
+ *  See the file "contribs/graph/LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/support.hh"
+#include "graphutils.icc"
+#include "graph.hh"
+using namespace Gecode::Graph;
+/** \brief Example to test the intantiateUB method of OutAdjSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphInstUB: public Example {
+        private:
+                OutAdjSetsGraphView g1;
+                OutAdjSetsGraphView g2;
+        public: 
+                /// Constructor with unused options
+                CPGraphInstUB(const Options& opt): g1(this,loadGraph("g1.txt")), g2(this,loadGraph("g1.txt")){
+                        cout << g1 << endl;
+                        cout << g2 << endl;
+                        g2.instantiateUB(this);
+                        g1.distrib(this);
+
+                }
+                /// Constructor for cloning \a s
+                CPGraphInstUB(bool share, CPGraphInstUB& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                        g2.update(this, share, s.g2);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphInstUB(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                                std::cout << "g1 = " << g1 << std::endl;
+                                std::cout << "g2 = " << g2 << std::endl;
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                        }
+};
+/** \brief Example to test the intantiateUB method of NodeArcSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphInstUB2vars: public Example {
+        private:
+                ArcNode *an ; //used for member init  
+                NodeArcSetsGraphView g1;
+                NodeArcSetsGraphView g2;
+        public: 
+                /// Constructor with unused options
+                CPGraphInstUB2vars(const Options& opt): an(new ArcNode(loadGraph("g1.txt").first.size())), g1(this,an,loadGraph("g1.txt")), g2(this,an,loadGraph("g1.txt")) {
+                        g2.instantiateUB(this);
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphInstUB2vars(bool share, CPGraphInstUB2vars& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                        g2.update(this, share, s.g2);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphInstUB2vars(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                                std::cout << "g1 = " << g1 << std::endl;
+                                std::cout << "g2 = " << g2 << std::endl;
+                                std::cout << std::endl << "!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"<<std::endl;
+                        }
+};
+int
+main(int argc, char** argv) {
+  Options opt("CPGraphInstUB");
+  opt.icl        = ICL_DOM;
+  opt.solutions        = 0;
+  opt.parse(argc,argv);
+  if (opt.size == 2){
+          Example::run<CPGraphInstUB2vars,DFS>(opt);
+  }else{
+          Example::run<CPGraphInstUB,DFS>(opt);
+  }
+  return 0;
+}

data/ext/gecode-1.3.1/contribs/graph/examples/cpgraph-path.cc

@@ -0,0 +1,92 @@
+
+/*
+ *  Main authors:
+ *     Gr�goire Dooms <dooms@info.ucl.ac.be>
+ *
+ *  Copyright:
+ *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
+ *
+ *  Last modified:
+ *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
+ *     $Revision: 271 $
+ *
+ *  This file is part of CP(Graph)
+ *
+ *  See the file "contribs/graph/LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/support.hh"
+#include "graphutils.icc"
+#include "graph.hh"
+using namespace Gecode::Graph;
+
+/** \brief Example to test the simple Path propagator with OutAdjSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphSimplePath: public Example {
+        private:
+                OutAdjSetsGraphView g1;
+        public: 
+                /// Constructor sith unused options
+                CPGraphSimplePath(const Options& opt): g1(this,loadGraph("g2.txt")){
+                        path(this,g1,0,5);
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphSimplePath(bool share, CPGraphSimplePath& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphSimplePath(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << "\tg1 = " << g1 << std::endl;
+                        }
+};
+/** \brief Example to test the simple Path propagator with NodeArcSetsGraphView 
+ * \ingroup Examples
+ * */
+class CPGraphSimplePath2vars: public Example {
+        private:
+                NodeArcSetsGraphView g1;
+        public: 
+                /// Constructor sith unused options
+                CPGraphSimplePath2vars(const Options& opt): g1(this,new ArcNode(loadGraph("g2.txt").second),loadGraph("g2.txt")){
+                        path(this,g1,0,5);
+                        g1.distrib(this);
+                }
+                /// Constructor for cloning \a s
+                CPGraphSimplePath2vars(bool share, CPGraphSimplePath2vars& s) : Example(share,s){
+                        g1.update(this, share, s.g1);
+                }
+                /// Copying during cloning
+                virtual Space*
+                        copy(bool share) {
+                                return new CPGraphSimplePath2vars(share,*this);
+                        }
+                /// Print the solution
+                virtual void
+                        print(void) {
+                                std::cout << "Solution \tg1 = " <<std::endl<<  g1 << std::endl;
+                        }
+};
+int
+main(int argc, char** argv) {
+  Options opt("CPGraphSimplePath");
+  opt.icl        = ICL_DOM;
+  opt.solutions        = 0;
+  opt.parse(argc,argv);
+  if (opt.size == 2){
+          Example::run<CPGraphSimplePath2vars,DFS>(opt);
+  }else{
+          Example::run<CPGraphSimplePath,DFS>(opt);
+  }
+  return 0;
+}