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

Imporove heuristics #18

Closed LdDl closed 3 years ago

LdDl commented 3 years ago

New heuristics: exclude biderectional edges from vertex's importance evaluation