Algorithm 2
From: A global empirical study on how street networks facilitate driving longer distances
Find borders (Paths \([P] = [path_1, path_2, path_3,..., path_{n-1}]\), Time limit \(\tau\)).
Algorithm 2 | Scientific Reports
From: A global empirical study on how street networks facilitate driving longer distances
Find borders (Paths \([P] = [path_1, path_2, path_3,..., path_{n-1}]\), Time limit \(\tau\)).
