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

[DOCUMENTATION] Visual explanation #23

Open LdDl opened 2 years ago

LdDl commented 2 years ago

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, draw graph and steps to reproduce CH algorithm and bidirectional search.

Additional context Fill wiki page - is a good idea too.