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
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