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

[MINOR] Format code #35

Closed LdDl closed 1 year ago

LdDl commented 1 year ago

Describe the proposal Since last set of PR's we need to run gofmt

Additional context Probably make it via VScode Also it could be cool to check if we need order alignment in structs