Multiple sources shortest path

[HungChang]

Hi,

In graph api there's an single source shortest path library.

DataSet<Vertex&lt;Long,Double>> singleSourceShortestPaths =
                graph.run(new SingleSourceShortestPaths<Long>(srcVertexId,
maxIterations)).getVertices();

For Multiple Source, would it be possible to run it for all nodes using
for-loop?
for example,

for(Node node: nodes){
 DataSet<Vertex&lt;Long,Double>> singleSourceShortestPaths =
                graph.run(new SingleSourceShortestPaths<Long>(node,
maxIterations)).getVertices();
}




--
View this message in context: 
http://apache-flink-incubator-user-mailing-list-archive.2336050.n4.nabble.com/Multiple-sources-shortest-path-tp729.html
Sent from the Apache Flink (Incubator) User Mailing List archive. mailing list 
archive at Nabble.com.