Fast First-Move Queries through Run-Length Encoding
DOI:
https://doi.org/10.1609/socs.v5i1.18311Keywords:
route planning, shortest paths, graphs, first-move, compressionAbstract
We introduce a novel preprocessing-based algorithm to solve the problem of determining the first arc of a shortest path in sparse graphs. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns in a first-move matrix and then performs run length encoding (RLE) on the contents of the matrix.
Downloads
Published
2021-09-01
Issue
Section
Full Papers