Partitioning graphs to speedup Dijkstra's algorithm
A fast and high quality multilevel scheme for partitioning irregular graphs