Yan Qi

Question 3: you may not need to duplicate the edges but have to change those maps for fanins and fanouts by doubling their entries. Question 2: you may need to...

Sure it is possible to replace the Dijkstra algorithm with yours. If it works well, you are welcome to add your approach. :)

Yes, you need to reset the intermediate weights of previous searches because the source/sink pair changes

The two methods in the Dijkstra implementation are defined not only for the shortest path calculation but also for the top-k shortest paths.

To Vivid, To be honest, I have never run the algorithm in such a big graph. Is it possible for you to send me the data? I want to have...

Sure. Please go ahead. Thanks

It would be great if @tilltnet could have a PR for the change. Thanks