23 ms·
> Time to precompute full chunk-graph distance matrix by repeatedly dijkstra-ing from each chunk to all chunks It’s faster to use an all-pairs shortest paths a
by amluto 7y ago
> Time to precompute full chunk-graph distance matrix by repeatedly dijkstra-ing from each chunk to all chunks
It’s faster to use an all-pairs shortest paths algorithm, of which there are several with better performance than what you’re suggesting.