I created FLINK-4965 "AllPairsShortestPaths" and FLINK-4966 "BetweennessCentrality".
On Wed, Oct 26, 2016 at 4:39 PM, Greg Hogan <c...@greghogan.com> wrote: > It sounds like you want to use an all-pairs shortest paths algorithm. This > would be a great contribution to Gelly! > https://en.wikipedia.org/wiki/Shortest_path_problem#All- > pairs_shortest_paths > > On Wed, Oct 26, 2016 at 9:29 AM, otherwise777 <wou...@onzichtbaar.net> > wrote: > >> That is indeed not the nice way to do it because it will create an >> executionplan just to get that value, but it does work, so thnx for that >> >> A more concrete example for what i want, >> In gelly you have the SingleSourceShortestPaths algorith which requires >> the >> sourceVertexId, now i want to execute a metric called the betweenness, >> this >> requires me to execute the algorithm on each of the nodes. If i need the >> id >> of every node that means i need to Collect() all those nodes as well, >> which >> means for a graph of 1000 nodes i have 1000+ execution plans >> >> >> >> -- >> View this message in context: http://apache-flink-user-maili >> ng-list-archive.2336050.n4.nabble.com/Retrieving-a-single >> -element-from-a-DataSet-tp9731p9734.html >> Sent from the Apache Flink User Mailing List archive. mailing list >> archive at Nabble.com. >> > >
