Let's consider a use case where we have data for the airports and the distance between them. In order to travel to certain destination from a particular airport, we have to find the shortest path between the two. Our airport data looks like as shown in the following table:
Id |
Airport name |
---|---|
s01 |
A |
s02 |
B |
s03 |
C |
s04 |
D |
s05 |
E |
The distance information between the airport looks like as shown in the following table:
From |
To |
Distance |
---|---|---|
s01 |
s02 |
10 |
s01 |
s02 |
12 |
s01 |
s03 |
22 |
s01 |
s04 |
21 |
s04 |
s11 |
22 |
s05 |
s15 |
21 |
s06 |
s17 |
21 |
s08 |
s09 |
11 |
s08 |
s09 |
12 |
Now let's use Gelly to find the Single Source Shortest Path.
Here we have options to choose among the three algorithms we learnt in previous section. In this example, we will use Vertex-Centric iterations method.
In order to solve the Single Source Shortest Path, we have to first load the data from CSV files as shown in the following code:
// set up the batch execution environment final ExecutionEnvironment...