gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/contribs/graph/shortdesc.ac

@@ -1 +0,0 @@
-graph variables

data/ext/gecode-1.3.1/contribs/graph/stlutility.icc

@@ -1,105 +0,0 @@
-
-/*
- *  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 21:15:36 +0100 (Tue, 29 Nov 2005) $
- *     $Revision: 280 $
- *
- *  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.
- *
- */
-
-#ifndef STLUTILITY_ICC
-#define STLUTILITY_ICC
-
-#include <list>
-#include <vector>
-#include <utility>
-
-/// outputs a vector<T> 
-template <class T>
-std::ostream&
-operator<<(std::ostream& os, const std::vector<T> &v){
-        os << "[";
-        for (typename std::vector<T>::const_iterator  i=v.begin(); i!=v.end(); ++i){
-                if (i!=v.begin()) { os <<", "; }
-                os << *i;
-        }
-        os << "]";
-        return os;
-}
-/// outputs a std::pair<T1,T2> 
-template <class T1,class T2>
-std::ostream&
-operator<<(std::ostream& os, const std::pair<T1,T2>  &p){
-        os << "(" << p->first << ", " << p->second << ")"; 
-        return os;
-}
-/// outputs a std::list of <T> 
-template <class T>
-std::ostream&
-operator<<(std::ostream& os, std::list<T> &l){
-        os << "[";
-        for (typename std::list<T>::const_iterator  i=l.begin(); i!=l.end(); ++i){
-                if (i!=l.begin()) { os <<", "; }
-                os << *i;
-        }
-        os << "]";
-        return os;
-}
-//TODO check we can get rid of this one 
-/// outputs a std::list of std::pair<T1,T2> 
-template <class T1,class T2>
-std::ostream&
-operator<<(std::ostream& os, std::list<std::pair<T1,T2> > &l){
-        os << "[";
-        for (typename std::list<std::pair<T1,T2> >::const_iterator  i=l.begin(); i!=l.end(); ++i){
-                if (i!=l.begin()) { os <<", "; }
-                os << "(" << i->first << ", " << i->second << ")"; 
-        }
-        os << "]";
-        return os;
-}
-namespace Gecode { namespace Graph {
-/** find the minimum val from a container in between two iterators */
-template <class iterator>
-typename std::iterator_traits<iterator>::value_type   
-    minimum(iterator begin, iterator end){
-            typedef typename std::iterator_traits<iterator>::value_type  T;
-            struct fmin : public std::unary_function<T,void>{
-                    T min;
-                    fmin(T init): min(init){}
-                    void operator() (T x) { if (x<min) min=x; }
-            };
-            fmin v;
-            std::for_each(begin,end,v);
-            return v.min;
-    }
-/** find the first iterator pointing on the minimum val from a container in between two iterators */
-template <class iterator>
-iterator
-    minimum_index(iterator begin, iterator end){
-            typedef typename std::iterator_traits<iterator>::value_type  T;
-            if (begin==end) return end;
-            T min = *begin;
-            iterator min_index = begin;
-            
-            for (iterator cur = begin; cur!=end; ++cur){
-                    if (*cur<min){
-                            min = *cur;
-                            min_index = cur;
-                    }
-            }
-            return min_index;
-    }
-} }
-#endif

data/ext/gecode-1.3.1/contribs/graph/var.icc

@@ -1,106 +0,0 @@
-
-/*
- *  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.
- *
- */
-
-
-
-
-namespace Gecode { namespace Graph {
-
-
-  /**
-   * \defgroup TaskActorGraphMEPC Graph modification events and propagation conditions
-   * \ingroup TaskActorSet
-   */
-
-  //@{
-
-  /// Domain operation has resulted in failure
-  const ModEvent ME_GRAPH_FAILED = ME_GEN_FAILED;
-  /// Domain operation has not changed domain
-  const ModEvent ME_GRAPH_NONE  = ME_GEN_NONE;
-  /// Domain operation has resulted in a value (assigned variable)
-  const ModEvent ME_GRAPH_VAL   = ME_GEN_ASSIGNED;
-
-  /**
-   * \brief Domain operation has changed the least upper bound 
-   *
-   * Note that this implies that the domain has not resulted in a value
-   * and that also neither cardinality nor the greatest lower bound
-   * have changed.
-   */
-  const ModEvent ME_GRAPH_LUB  = ME_GRAPH_VAL + 1;
-  /**
-   * \brief Domain operation has changed the greatest lower bound
-   *
-   * Note that this implies that the domain has not resulted in a value
-   * and that also neither cardinality nor the least upper bound
-   * have changed.
-   */
-  const ModEvent ME_GRAPH_GLB   = ME_GRAPH_LUB + 1;
-  /**
-   * \brief Domain operation has changed both greatest lower and least
-   * upper bound
-   *
-   * Note that this implies that the domain has not resulted in a value
-   * and that also the cardinality has not changed.
-   */
-  const ModEvent ME_GRAPH_BB    = ME_GRAPH_GLB + 1;
-
-
-
-  /**
-   * \brief Propagate when a view becomes assigned (single value)
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_GRAPH_VAL, then \a p is propagated when a domain
-   * update operation on \a x returns the modification event ME_GRAPH_VAL.
-   */
-  const PropCond PC_GRAPH_VAL  = PC_GEN_ASSIGNED;
-  /**
-   * \brief Propagate when the greatest lower bound of a view changes
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_GRAPH_GLB, then \a p is propagated when a domain
-   * update operation on \a x returns the modification event ME_GRAPH_VAL or 
-   * ME_GRAPH_GLB.
-   */
-  const PropCond PC_GRAPH_GLB  = PC_GRAPH_VAL + 1;
-  /**
-   * \brief Propagate when the least upper bound of a view changes
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_GRAPH_LUB, then \a p is propagated when a domain
-   * update operation on \a x returns the modification event ME_GRAPH_VAL or
-   * ME_GRAPH_LUB.
-   */
-  const PropCond PC_GRAPH_LUB  = PC_GRAPH_GLB + 1;
-  /**
-   * \brief Propagate when any bound of a view changes
-   *
-   * If a propagator \a p depends on a view \a x with propagation
-   * condition PC_GRAPH_ANY, then \a p is propagated when a domain
-   * update operation on \a x returns any modification event but ME_GRAPH_FAILED and
-   * ME_GRAPH_NONE.
-   */
-  const PropCond PC_GRAPH_ANY = PC_GRAPH_LUB + 1;
-  //@}
-  } }
-
-// STATISTICS: graph-var

data/ext/gecode-1.3.1/contribs/graph/view.icc

@@ -1,373 +0,0 @@
-
-/*
- *  Main authors:
- *     Gr�goire Dooms <dooms@info.ucl.ac.be>
- *
- *  Copyright:
- *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
- *
- *  Last modified:
- *     $Date: 2006-05-22 22:19:52 +0200 (Mon, 22 May 2006) $
- *     $Revision: 476 $
- *
- *  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 <iostream>
-#include <vector>
-        /// returns the current domain as stl data-structures
-#include <boost/tuple/tuple.hpp>
-//#include "iter.hh"
-
-#include "view/iter.icc"
-#include "view/arcnode.hh"
-
-//using namespace std;
-//using namespace boost;
-
-namespace Gecode { namespace Graph {
-/** 
- * \brief A graph view made over sets modeling an adjacency matrix. 
- *
- * each line of the matrix is a set variable.
- * \ingroup TaskPropViews
- * \ingroup TaskModel
- */
-struct OutAdjSetsGraphView  { 
-        SetVar nodes; ///< a set of node ids
-        SetVarArray outN; /// an Array of out-neighbours: at index i, get all out-neighbours of node i
-
-        /// \name Constructors and initialization
-        //@{
-        /** \brief  Default constructor
-         */
-        OutAdjSetsGraphView(void);
-        /** \brief  Builds a Graph view over a set of nodes and an array of outneighbors 
-         *
-         * The size of the \p outN array must be equal to nodes.max()-1
-         */
-        OutAdjSetsGraphView(Space *home, SetVar nodes, SetVarArray outN);
-        /** \brief  Builds a Graph view with the given lists of nodes and arcs as an upper bound and an empty lower bound
-         *  
-         */
-        OutAdjSetsGraphView(Space *home, const pair<vector<int>,vector<pair<int,int> > >& graph);
-        /** \brief  Builds a Graph view with an empty lower bound and a complete grpah of \p numNodes nodes as the upper bound
-         */
-        OutAdjSetsGraphView(Space *home, int numNodes);
-
-        /// \brief copy constructor for cloning
-        OutAdjSetsGraphView(const OutAdjSetsGraphView&);
-        //@}
-        
-        /** support for propagators */
-        /// subscribe \a p to this view with graph PC \a pc
-        void subscribe(Space* home, Propagator* p, PropCond pc);
-        /// cancel \a p to this view with graph PC \a pc
-        void cancel(Propagator* p, PropCond pc);
-        /// update this view during space cloning
-        void update(Space* home, bool share, OutAdjSetsGraphView& x);
-        /// \ingroup Basic tells for propagators 
-        //@{
-        /// \brief include an arc (\a a, \a b).
-        ModEvent _arcIn(Space *, int a, int b);
-        /// \brief exclude an arc (\a a, \a b).
-        ModEvent _arcOut(Space *, int a, int b);
-        /// \brief include a node \a a.
-        ModEvent _nodeIn(Space *, int a);
-        /// \brief exclude a node \a a.
-        ModEvent _nodeOut(Space *, int a);
-        //@}
-        /*\name Basic iterator tells for propagators 
-         *
-         * The arc iterators must be Gecode-value-style (val / op++ / op()) and 
-         * the value type must be a std::pair<int,int> of node ids
-         *
-         * The node iterators must be Gecode-value-style (val / op++ / op()) and 
-         * the value type must be a int node id
-         */
-        //@{
-        /// \brief includes all the arcs of I in the lower bound of the graph
-        template <class I> 
-        ModEvent _arcsIn(Space *, I&);
-        /// \brief excludes all the arcs of I from the upper bound of the graph
-        template <class I>
-        ModEvent _arcsOut(Space *, I&);
-        /// \brief includes all the nodes of I in the lower bound of the graph
-        template <class I>
-        ModEvent _nodesIn(Space *, I&);
-        /// \brief excludes all the nodes of I from the upper bound of the graph
-        template <class I>
-        ModEvent _nodesOut(Space *, I&);
-        /// sets the graph to its upper bound 
-        void instantiateUB(Space *);
-        /// sets the graph to its lower bound 
-        void instantiateLB(Space *);
-        //@}
-
-        ///\name Reflexion
-        //@{
-        /// maximum number of nodes of the graph
-        int lubOrder();
-        /// minimum number of nodes of the graph
-        int glbOrder();
-        /// maximum number of arcs of the graph
-        int lubSize();
-        /// maximum number of arcs of the graph
-        int glbSize();
-        /// maximum possible node id of this graph
-        int maxNodeId();
-        // template used internally to define arc iterators 
-        template <class> class _int_pair_gecode_iterator_outn;
-        typedef _int_pair_gecode_iterator_outn<Gecode::Set::LubRanges<Gecode::Set::SetView> > LubArcIterator ;
-        typedef _int_pair_gecode_iterator_outn<Gecode::Set::GlbRanges<Gecode::Set::SetView> > GlbArcIterator ;
-        /// returns a gecode val iterator on the arcs of the glb 
-        GlbArcIterator iter_arcs_LB();
-        /// returns a gecode val iterator on the arcs of the glb 
-        LubArcIterator iter_arcs_UB();
-        typedef Iter::Ranges::ToValues<SetVarLubRanges> LubNodeIterator ;
-        typedef Iter::Ranges::ToValues<SetVarGlbRanges> GlbNodeIterator ;
-        /// returns a gecode val iterator on the nodes of the glb 
-        GlbNodeIterator iter_nodes_LB();
-        /// returns a gecode val iterator on the nodes of the glb 
-        LubNodeIterator iter_nodes_UB();
-        typedef SetVarLubRanges LubNodeRangesIterator ;
-        typedef SetVarGlbRanges GlbNodeRangesIterator ;
-        /// returns a gecode range iterator on the nodes of the glb 
-        GlbNodeRangesIterator iter_nodes_ranges_LB();
-        /// returns a gecode range iterator on the nodes of the lub
-        LubNodeRangesIterator iter_nodes_ranges_UB();
-        /// tells if a node is in the upper bound of the graph
-        bool nodeIsInUB(int a);
-        /// tells if a node is in the lower bound of the graph
-        bool nodeIsInLB(int a);
-        /// tells if a arc is in the upper bound of the graph
-        bool arcIsInUB(int a, int b);
-        /// tells if a arc is in the lower bound of the graph
-        bool arcIsInLB(int a, int b);
-        /// sets \a nei to the vector of inward neighbours of a in the lub
-        void inNeighboursUB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of inward neighbours of a in the glb
-        void inNeighboursLB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of outward neighbours of a in the lub
-        void outNeighboursUB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of outward neighbours of a in the glb
-        void outNeighboursLB(int a, vector<int> &nei);
-        /// returns the inward degree of node a in the lub
-        int inDegreeUB(int a);
-        /// returns the inward degree of node a in the glb
-        int inDegreeLB(int a);
-        /// returns the outward degree of node a in the lub
-        int outDegreeUB(int a);
-        /// returns the outward degree of node a in the glb
-        int outDegreeLB(int a);
-        /// returns true if the domain of the nodes is a singleton
-        bool nodeAssigned();
-        /// returns true if the domain is a singleton
-        bool assigned();
-        /// returns the current domain as stl data-structures
-        boost::tuple<vector<int>,vector<int>,vector<pair<int,int> >,vector<pair<int,int> > > get_domain();
-        //@}
-        /// default branching strategy 
-        void distrib(Space * home);
-        private:
-        /// \brief posts the inherent graph constraint on the underlying views 
-        void arcImpliesNodes(Space * home);
-        std::pair<PropCond,PropCond> pc_g_to_set(PropCond pc);
-
-
-};
-
-
-
-
-/** \brief A graph view made over 2 sets: one for the nodes and one for the arcs.
- *
- * ArcNode is a datastructure for encoding/decoding arcs (pairs of nodes) as ints.
- * \ingroup TaskPropViews
- * \ingroup TaskModel
- */
-struct NodeArcSetsGraphView  { 
-           SetVar nodes; 
-           SetVar arcs; 
-           ArcNode *an;
-
-        /// \name Constructors and initialization
-        /// They all take an pointer to an ArcNode for the mapping between arc numbers and pairs of nodes.
-        //@{
-        ///\brief  Default constructor
-        NodeArcSetsGraphView(void);
-        ///\brief  Constructor from a given set of \a nodes and a given set of \a arcs
-        NodeArcSetsGraphView(Space *home, ArcNode *a, SetVar nodes, SetVar arcs);
-        /** \brief  Constructor from a given vector nodes and vector of arcs
-         *
-         * PRE: the \a nodes must be a vector of consecutive integers from 0 to N-1 
-         */
-        NodeArcSetsGraphView(Space *home, ArcNode *a, const pair<vector<int>,vector<pair<int,int> > >& graph);
-        ///\brief  Constructor for a complete upperbound graph of order \a numNodes
-        NodeArcSetsGraphView(Space *home, ArcNode *a, int numNodes);
-        ///\brief  Assignment copy constructor 
-        NodeArcSetsGraphView(const NodeArcSetsGraphView&);
-        //@}
-        
-        /// \name Support for propagators 
-        //@{
-        /// subscribe \a p to this view with graph PC \a pc
-        void subscribe(Space* home, Propagator* p, PropCond pc);
-        /// cancel \a p to this view with graph PC \a pc
-        void cancel(Propagator* p, PropCond pc);
-        /// update this view during space cloning
-        void update(Space* home, bool share, NodeArcSetsGraphView& x);
-        //@}
-        /** \name basic tells for propagators 
-         *
-         * Should not be used in modelling, only in propagators and branchings
-         */
-        //@{
-        /// includes an arc (a,b) 
-        ModEvent _arcIn(Space *, int a, int b);
-        /// excludes an arc (a,b) 
-        ModEvent _arcOut(Space *, int a, int b);
-        /// includes a node a
-        ModEvent _nodeIn(Space *, int a);
-        /// excludes a node a
-        ModEvent _nodeOut(Space *, int a);
-        //@}
-        /** \name Basic iterator tells for propagators 
-         *
-         *  The iterators must be Gecode-value-style (val / op++ / op()) and 
-         *  the value type must be a std::pair<int,int> of node ids
-         * 
-         *  The node iterators must be Gecode-value-style (val / op++ / op()) and 
-         *  the value type must be a int node id
-         */
-        //@{
-        /// \brief includes all the arcs of I in the lower bound of the graph
-        template <class I> 
-        ModEvent _arcsIn(Space *, I&);
-        /// \brief excludes all the arcs of I from the upper bound of the graph
-        template <class I>
-        ModEvent _arcsOut(Space *, I&);
-        /// \brief includes all the nodes of I in the lower bound of the graph
-        template <class I>
-        ModEvent _nodesIn(Space *, I&);
-        /// \brief excludes all the nodes of I from the upper bound of the graph
-        template <class I>
-        ModEvent _nodesOut(Space *, I&);
-        /// sets the graph to its upper bound 
-        void instantiateUB(Space *);
-        /// sets the graph to its lower bound 
-        void instantiateLB(Space *);
-        //@}
-
-        /** \name Reflexion
-         */
-        //@{
-        /// maximum number of nodes of the graph
-        int lubOrder();
-        /// minimum number of nodes of the graph
-        int glbOrder();
-        /// maximum number of arcs of the graph
-        int lubSize();
-        /// maximum number of arcs of the graph
-        int glbSize();
-        /// maximum possible node id of this graph
-        int maxNodeId();
-        /* \name Arc iterators
-         * Arc iterators have the gecode iterator interface. The val() method returns a pair<int,int>
-         */
-        //@{
-        //
-        /// template used internally to define arc iterators 
-        template <class> class _int_pair_gecode_iterator_2vars;
-        typedef _int_pair_gecode_iterator_2vars<SetVarLubRanges> LubArcIterator ;
-        typedef _int_pair_gecode_iterator_2vars<SetVarGlbRanges> GlbArcIterator ;
-        /// returns a gecode val iterator on the arcs of the glb 
-        GlbArcIterator iter_arcs_LB() const;
-        /// returns a gecode val iterator on the arcs of the glb 
-        LubArcIterator iter_arcs_UB() const;
-        typedef Iter::Ranges::ToValues<SetVarLubRanges> LubNodeIterator ;
-        typedef Iter::Ranges::ToValues<SetVarGlbRanges> GlbNodeIterator ;
-        /// returns a gecode val iterator on the nodes of the glb 
-        GlbNodeIterator iter_nodes_LB();
-        /// returns a gecode val iterator on the nodes of the glb 
-        LubNodeIterator iter_nodes_UB();
-        typedef SetVarLubRanges LubNodeRangesIterator ;
-        typedef SetVarGlbRanges GlbNodeRangesIterator ;
-        /// returns a gecode range iterator on the nodes of the glb 
-        GlbNodeRangesIterator iter_nodes_ranges_LB();
-        /// returns a gecode range iterator on the nodes of the lub
-        LubNodeRangesIterator iter_nodes_ranges_UB();
-        /// tells if a node is in the upper bound of the graph
-        bool nodeIsInUB(int a);
-        /// tells if a node is in the lower bound of the graph
-        bool nodeIsInLB(int a);
-        /// tells if a arc is in the upper bound of the graph
-        bool arcIsInUB(int a, int b);
-        /// tells if a arc is in the lower bound of the graph
-        bool arcIsInLB(int a, int b);
-        /// sets \a nei to the vector of inward neighbours of a in the lub
-        void inNeighboursUB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of inward neighbours of a in the glb
-        void inNeighboursLB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of outward neighbours of a in the lub
-        void outNeighboursUB(int a, vector<int> &nei);
-        /// sets \a nei to the vector of outward neighbours of a in the glb
-        void outNeighboursLB(int a, vector<int> &nei);
-        /// returns the inward degree of node a in the lub
-        int inDegreeUB(int a);
-        /// returns the inward degree of node a in the glb
-        int inDegreeLB(int a);
-        /// returns the outward degree of node a in the lub
-        int outDegreeUB(int a);
-        /// returns the outward degree of node a in the glb
-        int outDegreeLB(int a);
-        /// returns true if the domain is a singleton
-        bool assigned();
-        /// returns true if the domain of the nodes is a singleton
-        bool nodeAssigned();
-        //@}
-        /// returns the current domain as stl data-structures
-        boost::tuple<vector<int>,vector<int>,vector<pair<int,int> >,vector<pair<int,int> > > get_domain();
-        /// default branching strategy 
-        void distrib(Space * home);
-        private:
-        /// \brief posts the inherent graph constraint on the underlying views 
-        void arcImpliesNodes(Space * home);
-        std::pair<PropCond,PropCond> pc_g_to_set(PropCond pc);
-};
-
-
-
-/**
- * \brief SetView for the nodes of a GraphView
- * \relates Gecode::Graph::GraphView
- * \relates Gecode::Set::SetView
- * specialized for different graphviews
- */
-
-template <class GraphView>
-struct NodeSetView: public Set::SetView {
-          NodeSetView(const GraphView &){}  
-          NodeSetView(){}  
-};
-
-
-} }
-std::ostream&
-operator<<(std::ostream&, const Gecode::Graph::OutAdjSetsGraphView&);
-std::ostream&
-operator<<(std::ostream&, const Gecode::Graph::NodeArcSetsGraphView&);
-#include "view/outadjsets.icc"
-#include "view/nodearcsets.icc"
-#include "view/boundsgraphs.icc"
-#include "view/nodeset.icc"
-
-// STATISTICS: graph-var
-