anvaka / anvaka/ngraph.path

contraction hierarchies

Open
#15 1 comment 0 reactions 0 assignees View on GitHub
Dominant language
JavaScript
Stars
3.1k
Forks
192
PR merge metrics
No merged PRs in 30d

Description

You mention in your README that you want to know about faster algorithms.
The fastest I heard of for OpenStreetmap data is http://project-osrm.org/
Paper describing the concept: http://algo2.iti.kit.edu/documents/chbasedtnr_TR.pdf

Contributor guide

No contributing guide indexed for this repository

Research direction

Start with the README statement about faster algorithms, then read the linked OSRM project and contraction hierarchies paper. Determine the intended scope and whether this repository should support the suggested approach; the issue is complete only when that scope and an implementation path are established.

Written by the indexing model from the issue text.

Assessment

Tech stack
javascript
Domain
search
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
20/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.