Hello all!<br><br>Can anyone help me with getting K-shortest paths( say K=3) between a pair of origin and destination. I want to know if anyone has attempted this problem? 4The idea is to develop a sort of an extension to the pgdijkstra plugin that cartoweb provides.
<br><br><br>Thanks in advance!<br><br>Sasanka<br>