A parallel approach to the problem of answering shortest path queries in unit-weighted networks.
This approach expands the research done in: http://arxiv.org/pdf/1304.4661.pdf
The implementation of the paper: https://github.com/iwiwi/pruned-landmark-labeling