LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.

Date Created 2019-05-24 (5 years ago)

Commits 347 (last one about a year ago)

Stargazers 47 (0 this week)

Watchers 6 (0 this week)

Forks 5

License apache-2.0

Ranking

RepositoryStats indexes 585,880 repositories, of these LdDl/ch is ranked #479,161 (18th percentile) for total stargazers, and #298,152 for total watchers. Github reports the primary language for this repository as Go, for repositories using this language it is ranked #21,911/25,712.

LdDl/ch is also tagged with popular topics, for these it's ranked: hacktoberfest (#13,667/15268), graph (#781/911), hacktoberfest-accepted (#480/736)

Other Information

LdDl/ch has Github issues enabled, there are 6 open issues and 10 closed issues.

There have been 22 releases, the latest one was published on 2023-06-06 (about a year ago) with the name v1.7.8 - Fix ManyToMany.

All Topics

osm graph dijkstra isochrones pathfinding hacktoberfest isochrone-map shortest-paths hactoberfest2022 turn-restrictions dijkstra-algorithm breadth-first-search hacktoberfest-accepted contraction-hierarchies shortest-path-algorithm

Star History

Github stargazers over time

Watcher History

Github watchers over time, collection started in '23

Recent Commit History

57 commits on the default branch (master) since jan '22

Yearly Commits

Commits to the default branch (master) per year

Issue History

Languages

The only known language in this repository is Go

updated: 2024-08-04 @ 04:22am, id: 188397946 / R_kgDOCzq5eg