ch
ch copied to clipboard
LdDl
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
**What is your docs question about? Ask it** We need visual step-by-step explanation of what happens in graph during CH algorithm. **What do you suggest?** Take something like [Graphviz](https://graphviz.org/), draw...
**What is your docs question about? Ask it** I assumed `ShortestPathOneToMany` used some clever algorithmic trick (like unidirectional Dijkstra is able to calculate all targets for one source in one...
**Is your feature request related to a problem? Please describe.** Consider extension of current implementation with customization **Describe the solution you'd like and provide pseudocode examples if you can** Prepare...
**Is your feature request related to a problem? Please describe.** Let's take a laptop: ```shell goos: windows goarch: amd64 pkg: github.com/LdDl/ch cpu: Intel(R) Core(TM) i7-7700HQ CPU @ 2.80GHz ``` Run...
**Is your feature request related to a problem? Please describe.** Extend the way we store edges/vertices data. **Describe the solution you'd like and provide pseudocode examples if you can** Exported...
**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...