Is there any egde equilvant of nodes_within_driving_time?

[ghost]

Hello,

The nodes_within_driving_time(map, [source], time_limit)[1] returns a set of nodes that are whithin driving time. Is there any edge_within_driving_time or path_within_driving_time? Or any idea of how to go from node_within to path_within?

[pszufe]

There may be several paths between two nodes having some driving time. Currently for each node you would need to look for the path. It would be though possible to program a modified A* (A-star) implementation that yields all edges.