Kael Rowan

Foundations of Elegant Code

January, 2006

Posts
  • Kael Rowan

    PriorityQueue

    • 1 Comments
    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...
Page 1 of 1 (1 items)