Flink/Gelly - All-Pairs-Shortest-Path (APSP)
Please solve the All-Pairs-Shortest-Path problem with the use of the Gelly API. APSP computes the shortest paths between each pair of vertices.
The following data of the file data.csv is given:
Please use the following editor for your exercise. You can run the content of the editor by clicking on the tab 'Run'...
Output of Editor Content
The result of running the editor content is as follows:
Output of the Solution
The output of the solution is as follows:
Please have a look at the solution only after you have finished working on your own solution. Otherwise the learn effect is much less.