search

LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Apache License 2.0
46 stars 5 forks source link

[FEATURE REQUEST] Add max-cost path finder #7

Open LdDl opened 3 years ago

LdDl commented 3 years ago

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.