Finding the greenest bicycle path that connects all the parks in Barcelona
The shortest walk connecting all the parks was computed based on the road map. The existing bicycle lane does not connect all the parks in Barcelona. Hence, a second shortest path was created by pulling points from the road map to the bicycle lane.
The area with the most number of parks was identified.
The shortest path was then dispatched into multiple shortest paths between two parks in this area.
Computing the shortest bicycle path through all the parks showed the disconnect in the bicycle network. The new shortest walk combines the road and bicycle lane creating a new network. A cyclist looking for the greenest path can travel through the identified area with a high density of parks.
