graph.hpp climits /usr/include/gecode/int/distinct.hh Gecode Gecode::Int Gecode::Int::Distinct /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2003 * *Lastmodified: *$Date:2012-09-0717:31:22+0200(Fri,07Sep2012)$by$Author:schulte$ *$Revision:13068$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ #include<climits> namespaceGecode{namespaceInt{namespaceDistinct{ template<classView> forceinline Graph<View>::Graph(void){} template<classView> forceinlineExecStatus Graph<View>::init(Space&home,ViewArray<View>&x){ usingnamespaceViewValGraph; n_view=x.size(); view=home.alloc<ViewNode<View>*>(n_view); //Findvalueinformationforconstructionofviewvaluegraph intmin=x[n_view-1].min(); intmax=x[n_view-1].max(); for(inti=n_view-1;i--;){ min=std::min(min,x[i].min()); max=std::max(max,x[i].max()); } unsignedintwidth=static_cast<unsignedint>(max-min+1); //Definitlynotenoughvalues if(width<static_cast<unsignedint>(n_view)) returnES_FAILED; //Initializeviewnodes for(inti=n_view;i--;) view[i]=new(home)ViewNode<View>(x[i]); Regionr(home); if(static_cast<unsignedint>(n_view)*4>=width){ //Valuesaredense:useamapping ValNode<View>**val2node=r.alloc<ValNode<View>*>(width); for(unsignedinti=width;i--;) val2node[i]=NULL; for(inti=n_view;i--;){ Edge<View>**edge_p=view[i]->val_edges_ref(); for(ViewValues<View>xi(x[i]);xi();++xi){ if(val2node[xi.val()-min]==NULL) val2node[xi.val()-min]=new(home)ValNode<View>(xi.val()); *edge_p=new(home)Edge<View>(val2node[xi.val()-min],view[i]); edge_p=(*edge_p)->next_edge_ref(); } *edge_p=NULL; } for(unsignedinti=width;i--;) if(val2node[i]!=NULL){ val2node[i]->next_val(val); val=val2node[i]; n_val++; } }else{ //Valuesaresparse for(inti=n_view;i--;) ViewValGraph::Graph<View>::init(home,view[i]); } if(n_val<n_view) returnES_FAILED; typenameViewValGraph::Graph<View>::ViewNodeStackm(r,n_view); for(inti=n_view;i--;) if(!match(m,view[i])) returnES_FAILED; returnES_OK; } template<classView> forceinlinebool Graph<View>::sync(Space&home){ usingnamespaceViewValGraph; Regionr(home); //Stackforviewnodestoberematched typenameViewValGraph::Graph<View>::ViewNodeStackre(r,n_view); //Synchronizenodes for(inti=n_view;i--;){ ViewNode<View>*x=view[i]; if(x->view().assigned()){ x->edge_fst()->val(x)->matching(NULL); for(Edge<View>*e=x->val_edges();e!=NULL;e=e->next_edge()) e->unlink(); view[i]=view[--n_view]; }elseif(x->changed()){ ViewRanges<View>r(x->view()); Edge<View>*m=x->edge_fst();//Matchingedge Edge<View>**p=x->val_edges_ref(); Edge<View>*e=*p; do{ while(e->val(x)->val()<r.min()){ //Skipedge e->unlink();e->mark(); e=e->next_edge(); } *p=e; assert(r.min()==e->val(x)->val()); //Thisedgesmustbekept for(unsignedintj=r.width();j--;){ e->free(); p=e->next_edge_ref(); e=e->next_edge(); } ++r; }while(r()); *p=NULL; while(e!=NULL){ e->unlink();e->mark(); e=e->next_edge(); } if(m->marked()){ //Matchinghasbeendeleted! m->val(x)->matching(NULL); re.push(x); } x->update(); }else{ //Justfreeedges for(Edge<View>*e=x->val_edges();e!=NULL;e=e->next_edge()) e->free(); } } typenameViewValGraph::Graph<View>::ViewNodeStackm(r,n_view); while(!re.empty()) if(!match(m,re.pop())) returnfalse; returntrue; } template<classView> forceinlinebool Graph<View>::mark(Space&home){ usingnamespaceViewValGraph; Regionr(home); intn_view_visited=0; { //Marksalledgesasusedthatareonsimplepathsinthegraph //thatstartfromafree(unmatchednode)bydepth-first-search Support::StaticStack<ValNode<View>*,Region>visit(r,n_val); //Insertallfreenodes:theycanbeonlyvaluenodesaswe //haveamaximummatchingcoveringallviewnodes count++; { ValNode<View>**v=&val; while(*v!=NULL) if(!(*v)->matching()){ if((*v)->empty()){ *v=(*v)->next_val(); n_val--; }else{ (*v)->min=count; visit.push(*v); v=(*v)->next_val_ref(); } }else{ v=(*v)->next_val_ref(); } } //Invariant:onlyvaluenodesareonthestack! while(!visit.empty()){ ValNode<View>*n=visit.pop(); for(Edge<View>*e=n->edge_fst();e!=n->edge_lst();e=e->next()){ //Getthevaluenode e->use(); ViewNode<View>*x=e->view(n); if(x->min<count){ n_view_visited++; x->min=count; assert(x->edge_fst()->next()==x->edge_lst()); ValNode<View>*m=x->edge_fst()->val(x); x->edge_fst()->use(); if(m->min<count){ m->min=count; visit.push(m); } } } } } //Ifallviewnodeshavebeenvisited,alsoalledgesareused! if(n_view_visited<n_view){ scc(home); returntrue; }else{ returnfalse; } } template<classView> forceinlineExecStatus Graph<View>::prune(Space&home,bool&assigned){ usingnamespaceViewValGraph; assigned=false; //Tellconstraintsandalsoeliminatenodesandedges for(inti=n_view;i--;){ ViewNode<View>*x=view[i]; if(!x->edge_fst()->used(x)){ GECODE_ME_CHECK(x->view().eq(home,x->edge_fst()->val(x)->val())); x->edge_fst()->val(x)->matching(NULL); for(Edge<View>*e=x->val_edges();e!=NULL;e=e->next_edge()) e->unlink(); view[i]=view[--n_view]; assigned=true; }else{ IterPruneVal<View>pv(view[i]); GECODE_ME_CHECK(view[i]->view().minus_v(home,pv,false)); } } returnES_OK; } }}} //STATISTICS:int-prop