graph.hpp climits /usr/include/gecode/int/view-val-graph.hh /usr/include/gecode/int/view-val-graph/graph.hpp climits /usr/include/gecode/int/nvalues/int-base.hpp /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/distinct.hh /usr/include/gecode/int/nvalues/int-gq.hpp /usr/include/gecode/int/view-val-graph/graph.hpp /usr/include/gecode/int/nvalues/int-lq.hpp /usr/include/gecode/int/channel.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/view-val-graph.hh /usr/include/gecode/int/sorted/propagate.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/nvalues/int-eq.hpp /usr/include/gecode/int/circuit.hh Gecode Gecode::Int Gecode::Int::ViewValGraph /*-*-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{namespaceViewValGraph{ template<classView> forceinline Graph<View>::Graph(void) :view(NULL),val(NULL),n_view(0),n_val(0),count(1U){} template<classView> forceinlinebool Graph<View>::initialized(void)const{ returnview!=NULL; } template<classView> forceinlinevoid Graph<View>::init(Space&home,ViewNode<View>*x){ Edge<View>**edge_p=x->val_edges_ref(); ViewValues<View>xi(x->view()); ValNode<View>**v=&val; while(xi()&&(*v!=NULL)){ if((*v)->val()==xi.val()){ //Valuenodedoesalreadyexist,createnewedge *edge_p=new(home)Edge<View>(*v,x); edge_p=(*edge_p)->next_edge_ref(); v=(*v)->next_val_ref(); ++xi; }elseif((*v)->val()<xi.val()){ //Skiptonextvaluenode v=(*v)->next_val_ref(); }else{ //Valuenodedoesnotyetexist,createandlinkit ValNode<View>*nv=new(home)ValNode<View>(xi.val(),*v); *v=nv;v=nv->next_val_ref(); *edge_p=new(home)Edge<View>(nv,x); edge_p=(*edge_p)->next_edge_ref(); ++xi;n_val++; } } //Createmissingvaluenodes while(xi()){ ValNode<View>*nv=new(home)ValNode<View>(xi.val(),*v); *v=nv;v=nv->next_val_ref(); *edge_p=new(home)Edge<View>(nv,x); edge_p=(*edge_p)->next_edge_ref(); ++xi;n_val++; } *edge_p=NULL; } template<classView> forceinlinebool Graph<View>::match(ViewNodeStack&m,ViewNode<View>*x){ count++; start: //Trytofindmatchingedgecheaply:isthereafreeedgearound? { Edge<View>*e=x->val_edges(); //Thisholdstrueasdomainsareneverempty assert(e!=NULL); do{ if(!e->val(x)->matching()){ e->revert(x);e->val(x)->matching(e); //Foundamatching,revertalledgesonstack while(!m.empty()){ x=m.pop();e=x->iter; e->val(x)->matching()->revert(e->val(x)); e->revert(x);e->val(x)->matching(e); } returntrue; } e=e->next_edge(); }while(e!=NULL); } //No,findmatchingedgebyaugmentingpathmethod Edge<View>*e=x->val_edges(); do{ if(e->val(x)->matching()->view(e->val(x))->min<count){ e->val(x)->matching()->view(e->val(x))->min=count; m.push(x);x->iter=e; x=e->val(x)->matching()->view(e->val(x)); gotostart; } next: e=e->next_edge(); }while(e!=NULL); if(!m.empty()){ x=m.pop();e=x->iter;gotonext; } //Allnodesandedgesunsuccessfullytried returnfalse; } template<classView> forceinlinevoid Graph<View>::purge(void){ if(count>(UINT_MAX>>1)){ count=1; for(inti=n_view;i--;) view[i]->min=0; for(ValNode<View>*v=val;v!=NULL;v=v->next_val()) v->min=0; } } template<classView> forceinlinevoid Graph<View>::scc(Space&home){ Regionr(home); Support::StaticStack<Node<View>*,Region>scc(r,n_val+n_view); Support::StaticStack<Node<View>*,Region>visit(r,n_val+n_view); count++; unsignedintcnt0=count; unsignedintcnt1=count; for(inti=n_view;i--;) /* *Thefollowingtestissubtle:forscc,thetestshouldbe: *view[i]->min<count *However,ifview[i]<count-1,thenthenodehasalreadybeen *reachedonapathandalledgesconnectedtothenodehavebeen *markedanyway!Sojustignorethisnodealtogetherforscc. */ if(view[i]->min<count-1){ Node<View>*w=view[i]; start: w->low=w->min=cnt0++; scc.push(w); Edge<View>*e=w->edge_fst(); while(e!=w->edge_lst()){ if(e->dst(w)->min<count){ visit.push(w);w->iter=e; w=e->dst(w); gotostart; } next: if(e->dst(w)->low<w->min) w->min=e->dst(w)->low; e=e->next(); } if(w->min<w->low){ w->low=w->min; }else{ Node<View>*v; do{ v=scc.pop(); v->comp=cnt1; v->low=UINT_MAX; }while(v!=w); cnt1++; } if(!visit.empty()){ w=visit.pop();e=w->iter;gotonext; } } count=cnt0+1; } }}} //STATISTICS:int-prop