Table 1.

The calculation procedures for the distances of all bike-sharing trips.

1	Extract the bikeable road network in Beijing with OSMnx, which is denoted as $G\left(N,L\right),$where $N$ is the set of nodes, and $L$ is the set of links.
2	Define the sets of longitudes and latitudes of origins and destinations for bike sharing as ${(O}_{\mathit{lon}}{,O}_{\mathit{lat}})$ and ${(D}_{\mathit{lon}}{,D}_{\mathit{lat}})$, respectively.
3	Find the nearest point locations of ${(O}_{\mathit{lon}}{,O}_{\mathit{lat}})$ and ${(D}_{\mathit{lon}}{,D}_{\mathit{lat}})$from $G$, denoted as ${(O\text{'}}_{\mathit{lon}}{,O\text{'}}_{\mathit{lat}})$ and ${(D\text{'}}_{\mathit{lon}}{,D\text{'}}_{\mathit{lat}})$.
4	Input ${(O\text{'}}_{\mathit{lon}}{,O\text{'}}_{\mathit{lat}})$, ${(D\text{'}}_{\mathit{lon}}{,D\text{'}}_{\mathit{lat}})$ and $G$, utilizing Dijkstra algorithm to calculate the shortest paths of all bike-sharing trips.
5	Save the length of the shortest paths as $R$.