What's the syntax for using Dijkstra for k-shortest paths e.g. if I want to find the second or third-shortest paths to a vertex by distance? I thought I was onto something [here](https://github.com/YaccConstructor/QuickGraph/wiki/Dijkstra-Shortest-Distance-Example), but it was just displaying _all_ distances from one vertex.
What's the syntax for using Dijkstra for k-shortest paths e.g. if I want to find the second or third-shortest paths to a vertex by distance?
I thought I was onto something here, but it was just displaying all distances from one vertex.