[FEATURE REQUEST] Add max-cost path finder
@LdDl is already working on this.
Since Oct 16, 2020.
- Dominant language
- Go
- Stars
- 55
- Forks
- 8
- PR merge metrics
- No merged PRs in 30d
Description
Is your feature request related to a problem? Please describe.
Would be cool to find shortes path with max cost restriction option.
Describe the solution you'd like and provide pseudocode examples if you can
pseudocode:
fn ShortestPath(from, to, max_cost) {
if distance > max_cost {
stop
}
}
Describe alternatives you've considered and provide pseudocode examples if you can
nope
Additional context
It would be usefull for path estimation when we know max cost.
Example application: If I can't spend 5 minutes to reach destination point of interest on pedestrian based-graph, then I choose vehicle-based graph.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Assessment
This issue has not been assessed yet.