gecoder-with-gecode 0.7.1

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

@@ -0,0 +1,33 @@
+/*! \mainpage CP(Map) Documentation 
+ *
+ * This is the documentation of CP(Map) and CP(Map+Graph).
+ *
+ * As described in [1], Map variables and constraints 
+ * for approximate graph matching are implemented. The later constraints
+ * are implemented on top of CP(Map) and CP(Graph).
+ *
+ * Please refer to [1] and [2] for extensive description of this framework.
+ *
+ * \section ListIndex List and index content 
+ *
+ * The following lists and indices are available :
+ *  - <a class="el" href="modules.html">List of all modules</a> 
+ *  - <a class="el" href="annotated.html">List of all classes including brief documentation</a>
+ *  - <a class="el" href="namespaces.html">List of all namespaces including brief documentation</a>
+ *  - <a class="el" href="files.html">List of all files</a>
+ *  - <a class="el" href="hierarchy.html">Class hierarchy</a>
+ *  - <a class="el" href="classes.html">Alphabetical class index</a>
+ *  - <a class="el" href="namespacemembers.html">Namespace members</a>
+ *  - <a class="el" href="functions.html">Class members</a>
+ *  - <a class="el" href="globals.html">File members</a>
+ *
+ *
+ * \section Ref References :
+ * 
+ * [1] Y. Deville, G. Dooms, S. Zampelli and P. Dupont, CP(Graph+Map) for Approximate Graph Matching, 1st International Workshop on Constraint Programming Beyond Finite Integer Domains, Sitges (Barcelona), Spain, October 1, pp. 31-47, 2005.
+ * 
+ * [2] S. Zampelli, Y. Deville and P. Dupont, Declarative Approximate Graph Matching Using a Constraint Approach, Second International Workshop on Constraint Propagation and Implementation, Sitges (Barcelona), Spain, October 1, Vol. 1, pp. 109-124, 2005.
+ * 
+ */
+
+

data/ext/gecode-1.3.1/contribs/map/examples/approximateMatching.cc

@@ -0,0 +1,199 @@
+/*
+ *  Main authors:
+ *     Zampelli St�phane <sz@info.ucl.ac.be> 
+ *
+ *  Copyright:
+ *     Universit� catholique de Louvain, 2005
+ *
+ *  Last modified:
+ *     $Date$
+ *     $Revision$
+ *
+ *  This file is part of CP(Map)
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include <vector>
+#include "examples/support.hh"
+#include "minimodel.hh"
+#include "map.hh"
+#include "matching/mono.hh"
+#include "int.hh"
+#include "set.hh"
+#include "graph.hh"
+#include "graphutils.icc"
+
+using namespace Gecode::Map;
+using namespace Gecode::Graph;
+/**
+ * \defgroup MatchingExamples Matching Examples
+ * 
+ * Various matching examples, including graph isomorphism, subgraph monomorphism and
+ * approximate graph matching using CP(Graph+Map).
+ * 
+ */
+//@{
+/**
+ * \brief Approximate graph matching.
+ *
+ * Finds a monomorphic function between two graph variables.
+ *
+ * Note that forbdden edges may be declared on the pattern variable.
+ */
+class ApproximateMatching : public Example {
+  private:
+    OutAdjSetsGraphView P;
+    OutAdjSetsGraphView T;
+    OutAdjSetsGraphView p;
+    OutAdjSetsGraphView t;
+    OutAdjSetsGraphView Pc;
+    OutAdjSetsGraphView pc;
+    OutAdjSetsGraphView Tc;
+    OutAdjSetsGraphView tc;
+    MapVar M;
+
+  public:
+    ApproximateMatching(const Options& opt) : P(this,loadGraph("g1.txt")), T(this, loadGraph("g2.txt")), 
+					      p(this, loadGraph("g1.txt")), t(this, loadGraph("g2.txt")), 
+					      Pc(this, P.lubOrder()), pc(this, P.lubOrder()), 
+					      Tc(this, T.lubOrder()), tc(this, T.lubOrder()),
+					      M(this, P.nodes, T.nodes) 
+    {
+      TRACE_MAP(cout << "Pattern graph : " << endl);
+      TRACE_MAP(cout << P << endl);
+      TRACE_MAP(cout << "Target graph : " << endl);
+      TRACE_MAP(cout << T << endl);
+
+      vector<int> listOfMandatoryNodes;
+      listOfMandatoryNodes.push_back(0);
+      vector<pair <int,int> > listOfForbEdges;
+      listOfForbEdges.push_back(make_pair(0,1));
+
+      //force mandatory nodes 
+      vector<int>::iterator i;
+      for (i=listOfMandatoryNodes.begin(); i<listOfMandatoryNodes.end(); i++) {
+	TRACE_MAP(cout << "forced : " << *i << endl);
+	P._nodeIn(this, *i);
+      }
+
+      //force forbidden edges
+      int nbrPatternNodes = P.lubOrder();
+      for (int i=0; i<nbrPatternNodes; i++) {
+	for (int j=0; j<nbrPatternNodes; j++) {
+	  if (find(listOfForbEdges.begin(),listOfForbEdges.end(),make_pair(i,j))==listOfForbEdges.end()) {
+	    //p_{forb}=(N_p,F_p)
+	    TRACE_MAP(cout << "notforbidden " << i << " " << j << endl);
+	    pc._arcOut(this, i, j); 
+	    Pc._arcOut(this, i, j);
+	  }
+	  else
+	  {
+	    //p=(N_p,E_P)
+	    TRACE_MAP(cout << "forbidden : " << i << " " << j << endl);
+	    p._arcOut(this, i, j); 
+	    P._arcOut(this, i, j); 
+	  }
+	}	
+      }
+
+      //Graphs are induced, so that monoInduced can be used.
+
+      t.instantiateUB(this);
+      inducedSubgraph(this,T,t);
+
+      p.instantiateUB(this);
+      inducedSubgraph(this, P, p);
+
+      //Force Pattern and its forbidden edges represetation
+      //to be identical - mandatory for a proper matching.
+
+      rel(this,P.nodes,SRT_EQ,Pc.nodes);
+
+      //Pc must respect the minimal structure of forbidden
+      //edges declared.
+
+      pc.instantiateUB(this);
+      inducedSubgraph(this, Pc, pc);
+
+      //T and Tc are complement
+      //P and Pc are not complement because Pc represent
+      //the _subgraph_ of forbidden edges of P. Thus they
+      //are complement only if isomorphism is sought.
+
+      complement(this, T, Tc);
+
+      //Monomorphism constraints are posted on the primal model 
+      //and on the dual model. Note that the stronger propagator
+      //monoInduced can only be posted on P and T since Pc is not 
+      //induced.
+
+      //monoInduced(this,P,T,M);
+      mono(this,P,T,M);
+      mono(this,Pc,Tc,M);
+
+      //Branching is made upon M (viewed as an IntVar array)
+      //with a very naive heuristic.
+      branch(this, M, BVAR_SIZE_MIN, BVAL_MIN);  
+
+    }
+
+    /// Constructor for cloning \a s
+    ApproximateMatching(bool share, ApproximateMatching& s) : Example(share,s)
+    {
+      TRACE_MAP(cout << "update" << endl);
+      P.update(this,share,s.P);
+      T.update(this,share,s.T);
+      p.update(this,share,s.p);
+      t.update(this,share,s.t);
+      Pc.update(this,share,s.Pc);
+      pc.update(this,share,s.pc);
+      Tc.update(this,share,s.Tc);
+      tc.update(this,share,s.tc);
+      M.update(this,share,s.M); 
+      TRACE_MAP(M.print());
+      TRACE_MAP(cout << "endupdate" << endl);
+    } 
+
+    /// Perform copying during cloning
+    virtual Space*
+      copy(bool share) {
+	TRACE_MAP(cout << "copying" << endl);
+	return new ApproximateMatching(share,*this);
+      }
+
+    /// Print solution
+    virtual void print(void) {
+      cout << "\n----------\n----------\nNEW SOL :\n----------\n----------" << endl;
+      cout << P << endl;
+      cout << T << endl;
+      OutAdjSetsGraphView::GlbNodeIterator glbp = P.iter_nodes_LB();
+      while (glbp()) {
+	cout << "(" << glbp.val() << "," << M.imageAssigned(glbp.val()) << ")";
+	++glbp;
+      }
+      cout << endl;
+
+    }
+
+
+};
+//@}
+
+int main(int argc, char** argv) {
+  Options opt("ApproximateMatching");
+  opt.icl=ICL_DOM;
+  opt.solutions = 0;
+  opt.iterations = 200;
+  opt.size       = 100;
+  opt.c_d        = 5;
+  opt.parse(argc,argv);
+  Example::run<ApproximateMatching,DFS>(opt);
+  return 0;
+}
+
+// STATISTICS: example-any
+

data/ext/gecode-1.3.1/contribs/map/examples/g1.txt

@@ -0,0 +1 @@
+arc(0,1)arc(1,2)arc(2,0)

data/ext/gecode-1.3.1/contribs/map/examples/g2.txt

@@ -0,0 +1 @@
+arc(0,1)arc(1,2)arc(2,0)arc(2,3)arc(2,4)arc(3,5)arc(4,5)

data/ext/gecode-1.3.1/contribs/map/examples/isomorphism.cc

@@ -0,0 +1,148 @@
+/*
+ *  Main authors:
+ *     Zampelli St�phane <sz@info.ucl.ac.be> 
+ *
+ *  Copyright:
+ *     Universit� catholique de Louvain, 2005
+ *
+ *  Last modified:
+ *     $Date$
+ *     $Revision$
+ *
+ *  This file is part of CP(Map)
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include <iostream>
+#include <iomanip>
+
+#include <cstdlib>
+#include <cstring>
+
+#include "kernel.hh"
+#include "search.hh"
+
+#include "examples/support.hh"
+#include "examples/timer.hh"
+#include "minimodel.hh"
+#include "map.hh"
+#include "matching/mono.hh"
+#include "int.hh"
+#include "set.hh"
+#include "graph.hh"
+#include "graphutils.icc"
+
+using namespace Gecode::Map;
+
+/**
+ * 
+ * \brief Graph isomorphism problem
+ * \ingroup MatchingExamples
+ * 
+ *  Treats the graph isomorphism problem between two ground graphs
+ *  and finds the corresponding function.
+ */
+//@{
+class Isomorphism : public Example {
+   private:
+      OutAdjSetsGraphView P;
+      OutAdjSetsGraphView T;
+      OutAdjSetsGraphView t;
+      MapVar M;
+
+   public:
+      Isomorphism(const Options& opt, const string pattern, const string target) 
+	 : P(this,loadAmalfi(pattern)), T(this, loadAmalfi(target)), t(this, loadAmalfi(target)),
+	 M(this, P.nodes, T.nodes) 
+	 {
+	    TRACE_MAP(cout << "Pattern graph : " << endl);
+	    TRACE_MAP(cout << P << endl);
+	    TRACE_MAP(cout << "Target graph : " << endl);
+	    TRACE_MAP(cout << T << endl);
+
+	    P.instantiateUB(this);
+	    //T.instantiateUB(this);
+
+	    //isomorphism performing propagation
+	    isoInduced(this, P, T, M);
+	    branch(this, M, BVAR_SIZE_MIN, BVAL_MIN);  
+	 }
+
+      /// Constructor for cloning \a s
+      Isomorphism(bool share, Isomorphism& s) : Example(share,s)
+      {
+	 TRACE_MAP(cout << "update" << endl);
+	 P.update(this,share,s.P);
+	 T.update(this,share,s.T);
+	 t.update(this,share,s.t);
+	 M.update(this,share,s.M); 
+	 TRACE_MAP(M.print());
+	 TRACE_MAP(cout << "endupdate" << endl);
+      } 
+
+      /// Perform copying during cloning
+      virtual Space*
+	 copy(bool share) {
+	    TRACE_MAP(cout << "copying" << endl);
+	    return new Isomorphism(share,*this);
+	 }
+
+      /// Print solution
+      virtual void print(void) {
+	 cout << "\n----------\n----------\nSOLUTION :\n----------\n----------" << endl;
+	 for (int i=0; i<(int) M.maxInitDomSize(); i++)
+	 {
+	    cout <<"(" << i << ", " << M.imageAssigned(i) << ")";
+	 }
+	 cout << endl;
+      }
+
+
+};
+//@}
+   int main(int argc, char** argv) {
+      if (argc<3)
+	 cout << argv[0] << " <Pattern file> <Target file>" << endl;
+      Options o("Isomorphism");
+      o.solutions = 0;
+      o.iterations = 200;
+      o.size       = 100;
+      o.c_d        = 5;
+      //o.parse(argc,argv);
+      Timer t;
+      int i = o.solutions;
+      t.start();
+      string s1(argv[1]);
+      string s2(argv[2]);
+      Isomorphism* s = new Isomorphism(o, s1, s2);
+      DFS<Isomorphism> e(s,o.c_d,o.a_d);
+	delete s;
+	do {
+	  Example* ex = e.next();
+	  if (ex == NULL)
+	    break;
+	  ex->print();
+	  delete ex;
+	} while (--i != 0);
+	Search::Statistics stat = e.statistics();
+	cout << endl;
+	cout << "Summary" << endl
+	     << "\truntime:      " << t.stop() << endl
+	     << "\tsolutions:    " << abs(static_cast<int>(o.solutions) - i) << endl
+	     << "\tpropagations: " << stat.propagate << endl
+	     << "\tfailures:     " << stat.fail << endl
+	     << "\tclones:       " << stat.clone << endl
+	     << "\tcommits:      " << stat.commit << endl
+	     << "\tpeak memory:  " 
+	     << static_cast<int>((stat.memory+1023) / 1024) << " KB"
+	     << endl;
+
+      return 0;
+   }
+
+// STATISTICS: example-any
+

data/ext/gecode-1.3.1/contribs/map/examples/map.cc

@@ -0,0 +1,80 @@
+/*
+ *  Main authors:
+ *     Zampelli St�phane <sz@info.ucl.ac.be> 
+ *
+ *  Copyright:
+ *     Universit� catholique de Louvain, 2005
+ *
+ *  Last modified:
+ *     $Date$
+ *     $Revision$
+ *
+ *  This file is part of CP(Map)
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+
+#include "examples/support.hh"
+#include "minimodel.hh"
+#include "map.hh"
+
+using namespace Gecode::Map;
+/**
+ *
+* \brief Simple example of using a Mapvar in a script. For now only tells are possible on the MapVar.
+ *
+ * For extensive examples on MapVars, please refer to matching examples.
+ * 
+ * Constraint map(Space *home, IntVar I1, IntVar I2) will be implemented in CP(Map) 0.2.
+ *
+ */
+class MapProblem : public Example {
+   protected:
+      SetVar Dom;
+      SetVar Codom;
+      MapVar M;
+   public:
+      MapProblem(const Options& opt) : Dom(this,IntSet::empty,IntSet(1,3)), Codom(this,IntSet::empty,IntSet(1,3)), M(this,Dom,Codom) {
+	 branch(this, M, BVAR_SIZE_MIN, BVAL_MIN);  
+      }
+
+      /// Constructor for cloning \a s
+      MapProblem(bool share, MapProblem& s) : Example(share,s)
+      {
+	 M.update(this,share,s.M);
+      }
+
+      /// Perform copying during cloning
+      virtual Space*
+	 copy(bool share) {
+	    return new MapProblem(share,*this);
+	 }
+
+      /// Print solution
+      virtual void
+	 print(void) {
+	    cout << "\n----------\n----------\nSOLUTION :\n----------\n----------" << endl;
+	    for (int i=0; i<(int) M.maxInitDomSize(); i++)
+	    {
+	       cout <<"(" << i << ", " << M.imageAssigned(i) << ")";
+	    }
+	    cout << endl;
+	 }
+};
+
+int main(int argc, char** argv) {
+  Options opt("MapProblem");
+  opt.iterations = 200;
+  opt.size       = 100;
+  opt.c_d        = 5;
+  opt.parse(argc,argv);
+  Example::run<MapProblem,DFS>(opt);
+  return 0;
+}
+
+// STATISTICS: example-any
+