Opened 15 years ago
Last modified 12 years ago
#249 assigned enhancement
Bidirectional Bfs and Dijkstra
Reported by: | Peter Kovacs | Owned by: | Peter Kovacs |
---|---|---|---|
Priority: | major | Milestone: | |
Component: | core | Version: | hg main |
Keywords: | Cc: | ||
Revision id: |
Description
It would be nice to have bidirectional Bfs and Dijkstra implementation in LEMON for the s-t shortest path problem.
Theoretically it is simple: the algorithm should be started "in parallel" from the source node s on the original graph and from the target node t on the reversed graph. As soon as we have a node u for which both direction have set the final dist and pred values, we can finish searching and construct the s->t path form the s->u path and the opposite of the t->u path. It could be faster by about a factor of two due to smaller search spaces.
However it is not clear for me how difficult it would be to implement it.
Change History (4)
comment:1 follow-up: 2 Changed 15 years ago by
comment:2 Changed 15 years ago by
Replying to alpar:
It is a bit more difficult, even theoretically (it may be that the path s->u->t is not the shortest one).
Oops, I'm sorry. You are right. I've heard (or studied?) this method in this way, but it's wrong.
E.g. G = ({s,u,v,w,t},{su,ut,sv,vw,wt}), c(su)=c(ut)=80, c(sv)=c(w,t)=10, c(vw)=100. Here the shortest path is <sv,vw,wt>, not <su,ut>.
comment:3 Changed 15 years ago by
Milestone: | LEMON 1.2 release |
---|
comment:4 Changed 12 years ago by
Owner: | changed from Alpar Juttner to Peter Kovacs |
---|---|
Status: | new → assigned |
Tamas Bibok implemented bidirectional Dijkstra and A* (A-star) algorithms for LEMON. These codes and his BSc thesis (in Hungarian) can be found in this repository:
http://lime.cs.elte.hu/~kpeter/hg/hgwebdir.cgi/lemon-astar/
Replying to kpeter:
It is a bit more difficult, even theoretically (it may be that the path s->u->t is not the shortest one).