| Craig Silverstein (2007) | |||||||||||||||
Abstract | |||||||||||||||
| A 2-level bucket data structure has been shown to perform well in a Dijkstra's algorithm implementation [4, 5]. In this paper we study how the implementation performance depends on the number of bucket levels used. In particular we are interested in the best number of levels to use in practice. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||