LdDl / LdDl/ch

[FEATURE REQUEST] Add max-cost path finder

Open
#7 0 comments 0 reactions 1 assignee View on GitHub

@LdDl is already working on this.

Since Oct 16, 2020.

enhancement
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

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.