Open ghost opened 1 year ago
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.
Hello,
The
nodes_within_driving_time(map, [source], time_limit)[1]
returns a set of nodes that are whithin driving time. Is there anyedge_within_driving_time
orpath_within_driving_time
? Or any idea of how to go fromnode_within
topath_within
?