diff options
| author | jkoan <jkoan@users.noreply.github.com> | 2019-01-11 08:27:59 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-01-11 08:27:59 +0100 |
| commit | 5cf646c8f521db88bb68f5f7ca20c35c3474606b (patch) | |
| tree | 70437925b90e67344e697dd88a1f18fe12805624 /README.md | |
| parent | 88e0ebc9d6506ce9ddd0f137c3f1db9cee3ba593 (diff) | |
| download | navit-5cf646c8f521db88bb68f5f7ca20c35c3474606b.tar.gz | |
fix:correct link in Markdown
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -77,7 +77,7 @@ Navit reads the current vehicle position: Routing algorithm ================= -Navit uses LPA* (see https://en.wikipedia.org/wiki/Lifelong_Planning_A*), a derivative of the Dijkstra algorithm, for +Navit uses LPA* (see [Lifelong_Planning_A*](https://en.wikipedia.org/wiki/Lifelong_Planning_A*)), a derivative of the Dijkstra algorithm, for routing. Routing starts at the destination by assigning a value to each point directly connected to the destination point. The value represents the estimated time needed to reach the destination from that point. @@ -91,4 +91,4 @@ destination. LPA* is slightly more complex, as it allows partial re-evaluation of the route graph as segment costs change. This is used by the (still experimental) traffic module, which can process traffic reports and tries to find a way around -traffic problems. Refer to the Wikipedia page for a full description.
\ No newline at end of file +traffic problems. Refer to the Wikipedia page for a full description. |