Re: Multiple sources shortest path

In general, all-pairs-shortest-paths is a non-scalable problem as it produces output proportional to the square of the number of vertices in a network. --sebastian On 15.02.2015 12:37, Vasiliki Kalavri wrote: Hi, you can certainly use a for-loop like this to run SSSP several times. Just mak

Re: Can a master class control the superstep in Flink Spargel ?

Hi, currently, there is no such built-in master compute class, but you can easily have the equivalent functionality it as follows: - If your algorithm has a fixed pattern of superstep types, e.g. an initialization superstep, a main phase and a finalization superstep, then you can simply chain the

Re: Multiple sources shortest path

Hi, you can certainly use a for-loop like this to run SSSP several times. Just make sure you return or store the result of the computation for each source, by adding a data sink e.g.: for (id : Ids) { graph.run(new SingleSourceShortestPaths(id, maxIterations)) .getVertices().print();