The fastest travel time in minutes between every pair of places of a road network given by link lengths (km) and speeds (km/h), as a matrix in alphabetical order of the places (the skim used for trip distribution).
t_{ij} = \min_{paths\ i \to j} \sum t_{link}
Inputs
roads roads as 'A-B length' with lengths in km edgesspeeds speed on each road in km/h, in the same order vectordirected one-way links as written (default no) boolean optional
Returns
places places in the order of the matrixtimes travel time matrix (min)
Applies when
- every place reachable
- at most 60 places
Example
m.ask("Travel time skim with roads = [A-B 4, A-C 2.5, B-C 1.2, B-D 5, C-D 8, C-E 10, D-E 2] and speeds = [60, 50, 40, 80, 100, 90, 50].")
→ places = A, B, C, D, E, times = [[0.0, 4.0, 3.0, 7.75, 9.66666666667], [4.0, 0.0, 1.8, 3.75, 6.15], [3.0, 1.8, 0.0, 4.8, 6.66666666667], [7.75, 3.75, 4.8, 0.0, 2.4], [9.66666666667, 6.15, 6.66666666667, 2.4, 0.0]]