github.com/lddl/ch
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
View on Github
Activity
- Latest release
- 3w ago
- Total releases
- 21
- Cadence
- ~15 days
- Last 12 months
- 4
Reach
- Stars
- 55
Details
- First release
- Dec 20, 2019
| Version | Released | |
|---|---|---|
v1.11.0
minor
|
v1.11.0
minor
Dependencies (2)
|
|
v1.10.0
minor
|
v1.10.0
minor
Dependencies (2)
|
|
v1.9.0
minor
|
v1.9.0
minor
Dependencies (2)
|
|
v1.8.0
minor
|
v1.8.0
minor
Dependencies (1)
|
|
v1.7.8
patch
|
v1.7.8
patch
Dependencies (1)
|
|
v1.7.7
patch
|
v1.7.7
patch
Dependencies (1)
|
|
v1.7.6
patch
|
v1.7.6
patch
Dependencies (1)
|
|
v1.7.5
patch
|
v1.7.5
patch
Dependencies (1)
|
|
v1.7.4
patch
|
v1.7.4
patch
Dependencies (1)
|
|
v1.7.3
patch
|
v1.7.3
patch
Dependencies (1)
|
|
v1.7.2
patch
|
v1.7.2
patch
Dependencies (1)
|
|
v1.7.1
patch
|
v1.7.1
patch
Dependencies (1)
|
|
v1.7.0
minor
|
v1.7.0
minor
Dependencies (1)
|
|
v1.6.0
minor
|
v1.6.0
minor
Dependencies (1)
|
|
v1.5.0
minor
|
v1.5.0
minor
Dependencies (1)
|
|
v1.4.6
patch
|
v1.4.6
patch
|
|
v1.4.5
patch
|
v1.4.5
patch
|
|
v1.4.4
minor
|
v1.4.4
minor
Dependencies (3)
|
|
v1.3.4
patch
|
v1.3.4
patch
Dependencies (3)
|
|
v1.3.3
patch
|
v1.3.3
patch
Dependencies (2)
|
|
v1.3.0
initial
|
v1.3.0
initial
Dependencies (2)
|