matching.hpp /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/sorted/matching.hpp /usr/include/gecode/int/sorted.hh Gecode Gecode::Int Gecode::Int::Sorted /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *PatrickPekczynski<pekczynski@ps.uni-sb.de> * *Copyright: *PatrickPekczynski,2004 * *Lastmodified: *$Date:2009-09-0821:10:29+0200(Tue,08Sep2009)$by$Author:schulte$ *$Revision:9692$ * *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. * */ namespaceGecode{namespaceInt{namespaceSorted{ template<classView> inlinebool glover(ViewArray<View>&x,ViewArray<View>&y, inttau[],intphi[],OfflineMinItemsequence[],intvertices[]){ intxs=x.size(); OfflineMinseq(sequence,vertices,xs); ints=0; seq.makeset(); for(intz=0;z<xs;z++){//forallynodes intmaxy=y[z].max(); //creatingthesequenceofinsertsandextractionsfromthequeue for(;s<xs&&x[s].min()<=maxy;s++){ seq[s].iset=z; seq[z].rank++; } } //offline-min-procedure for(inti=0;i<xs;i++){ //theupperboundofthex-nodeshouldbeminimal intperm=tau[i]; //findtheiterationwhere\tau(i)becameamachingcandidate intiter=seq[perm].iset; if(iter<0) returnfalse; intj=0; j=seq.find_pc(iter); //checkwhetherthesequenceisvalid if(j>=xs) returnfalse; //ifthereisnointersectionbetweenthematchingcandidate //andtheynodethenthereexistsNOperfectmatching if(x[perm].max()<y[j].min()) returnfalse; phi[j]=perm; seq[perm].iset=-5;//removefromcandidateset intsqjsucc=seq[j].succ; if(sqjsucc<xs){ seq.unite(j,sqjsucc,sqjsucc); }else{ seq[seq[j].root].name=sqjsucc;//endofsequenceachieved } //adjusttreelist intpr=seq[j].pred; if(pr!=-1) seq[pr].succ=sqjsucc; if(sqjsucc!=xs) seq[sqjsucc].pred=pr; } returntrue; } template<classView> inlinebool revglover(ViewArray<View>&x,ViewArray<View>&y, inttau[],intphiprime[],OfflineMinItemsequence[], intvertices[]){ intxs=x.size(); OfflineMinseq(sequence,vertices,xs); ints=xs-1; seq.makeset(); intminy=0; for(intz=xs;z--;){//forallynodes miny=y[z].min(); //creatingthesequenceofinsertsandextractionsfromthequeue for(;s>-1&&x[tau[s]].max()>=miny;s--){ seq[tau[s]].iset=z; seq[z].rank++; } } //offline-min-procedure for(inti=xs;i--;){ intperm=i; intiter=seq[perm].iset; if(iter<0) returnfalse; intj=0; j=seq.find_pc(iter); if(j<=-1) returnfalse; //ifthereisnointersectionbetweenthematchingcandidate //andtheynodethenthereexistsNOperfectmatching if(x[perm].min()>y[j].max()) returnfalse; phiprime[j]=perm; seq[perm].iset=-5; intsqjsucc=seq[j].pred; if(sqjsucc>=0){ seq.unite(j,sqjsucc,sqjsucc); }else{ seq[seq[j].root].name=sqjsucc;//endofsequenceachieved } //adjusttreelist intpr=seq[j].succ; if(pr!=xs) seq[pr].pred=sqjsucc; if(sqjsucc!=-1) seq[sqjsucc].succ=pr; } returntrue; } }}} //STATISTICS:int-prop