Abstract. We construct a readable, compact and efficient implementation of Dijkstra’s shortest path algorithm and Fibonacci heaps using Constraint Handling Rules (CHR), which is increasingly used as a high-level rule-based general-purpose programming lang
:-:-:-:-dijkstra.chrmodule(dijkstra,[edge/3,dijkstra/1]).use_module(library(chr)).use_module(fib_heap).constraintsedge(+dense_int,+int,+number),distance(+dense_int,+number),dijkstra(+int),scan(+int,+number),relabel(+int,+number).
start_scanning@dijkstra(A)<=>scan(A,0).final_dist@scan(N,L)==>distance(N,L).label_neighb@scan(N,L),edge(N,N2,W)==>L2isL+W,relabel(N2,L2).scan_next@scan(N,L)<=>extract_min(N2,L2)|scan(N2,L2).scan_done@scan(N,L)<=>true.scanned@distance(N,_)\relabel(N,_)<=>true.not_scanned@relabel(N,L)<=>decr_or_ins(N,L).
Fig.1.Dijkstra’salgorithm,implementedinCHR.fibheap.chr:-module(fib_heap,[insert/2,extract_min/2,decr/2,decr_or_ins/2]).:-use_module(library(chr)).:-constraintsinsert(+int,+number),extract_min(?int,?number),mark(+int),decr(+int,+number),decr_or_ins(+int,+number),ch2rt(+int),decr(+int,+number,+int,+int,+mark),min(+int,+number),item(+dense_int,+number,+int,+dense_int,+mark),findmin.:-chr_typemark--->m;u.
insert@insert(I,K)<=>item(I,K,0,0,u),min(I,K).
keep_min@min(_,A)\min(_,B)<=>A=<B|true.
extr@extract_min(X,Y),min(I,K),item(I,_,_,_,_)<=>ch2rt(I),findmin,X=I,Y=K.extr_none@extract_min(_,_)<=>fail.
c2r@ch2rt(I)\item(C,K,R,I,_)#X<=>item(C,K,R,0,u)pragmapassive(X).c2r_done@ch2rt(I)<=>true.
findmin@findmin,item(I,K,_,0,_)==>min(I,K).foundmin@findmin<=>true.
same_rank@item(I1,K1,R,0,_),item(I2,K2,R,0,_)<=>R1isR+1,(K1<K2->item(I2,K2,R,I1,u),item(I1,K1,R1,0,u);item(I1,K1,R,I2,u),item(I2,K2,R1,0,u)).
decr@decr(I,K),item(I,O,R,P,M)<=>K<O|decr(I,K,R,P,M).decr_nok@decr(I,K)<=>fail.
doi_d@item(I,O,R,P,M),decr_or_ins(I,K)<=>K<O|decr(I,K,R,P,M).doi_nop@item(I,O,_,_,_)\decr_or_ins(I,K)<=>K>=O|true.doi_insert@decr_or_ins(I,K)<=>insert(I,K).
d_mind_rootd_okd_prob
m_rtm_mm_um_er@@@@@@@@decr(I,K,_,_,_)==>min(I,K).decr(I,K,R,0,_)<=>item(I,K,R,0,u).item(P,PK,_,_,_)\decr(I,K,R,P,M)<=>K>=PK|item(I,K,R,P,M).decr(I,K,R,P,M)<=>item(I,K,R,0,u),mark(P).mark(I),item(I,K,R,0,_)<=>R1isR-1,item(I,K,R1,0,u).mark(I),item(I,K,R,P,m)<=>R1isR-1,item(I,K,R1,0,u),mark(P).mark(I),item(I,K,R,P,u)<=>R1isR-1,item(I,K,R1,P,m).mark(I)<=>writeln(error_mark),fail.
Fig.2.Fibonacciheap,implementedinCHR.
Dijkstra’s algorithm wi... 16页 免费 Dijkstra... Meeting 11 October 4, 2005 Fibonacci Heaps The...cost applied to an initially empty Fibonacci heap...
Dijkstra’s algorithm wi... 10页 免费 Rangan. Relaxed fibonacc... 暂无...[5] invented an implementation of the priority queue called Fibonacci heaps....
Dijkstra’s algorithm wi... 10页 免费 Rangan. Relaxed fibonacc... 暂无...[5] invented an implementation of the priority queue called Fibonacci heaps....
热门文档