January, 2006

I’m implementing a single-source multiple-target version of Dijkstra's shortest path algorithm that stops when it reaches a requested number of targets. In order to do this, I’m using a priority queue where target vertices are prioritized by shortest...