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

Clear code and add clarifications #22

Closed LdDl closed 2 years ago

LdDl commented 2 years ago

Cleaned up code:

  1. redudant code blocks
  2. redudant functions
  3. redudant inializations

Created some comments to clarify how contraction hierarchies work