Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Is there any egde equilvant of nodes_within_driving_time? #70

Open
ghost opened this issue Apr 30, 2023 · 1 comment
Open

Is there any egde equilvant of nodes_within_driving_time? #70

ghost opened this issue Apr 30, 2023 · 1 comment

Comments

@ghost
Copy link

ghost commented Apr 30, 2023

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
Copy link
Owner

pszufe commented May 3, 2023

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@pszufe