N shortest paths should implicitly remove duplicates

[samblau]

If a user asks for the 50 shortest paths from [A,B] to X, they should get 50 unique paths and not 50 paths including a whole bunch of duplicates. Every PR implicitly duplicates a path, so if a shortest path has multiple PRs, we'll get a lot of duplicates which all have the same cost.