1
$\begingroup$

We all know Dijkstra and so on. But is there a way to extend this to get the N best shortest paths between 2 nodes? ...and still with "acceptable" complexity.

Thanks, Arnaud

  • 4
    The literature about this uses a different variable: search for "k-shortest path" and you should turn up lots of material.2011-02-04
  • 0
    ...well, I would be glad to accept the comment as correct answer ...but it is only a comment2011-02-04

1 Answers 1