summaryrefslogtreecommitdiffstats
path: root/_log/neo4j-a-star-search.md
diff options
context:
space:
mode:
authorSadeep Madurange <sadeep@asciimx.com>2026-01-08 22:28:37 +0800
committerSadeep Madurange <sadeep@asciimx.com>2026-01-08 22:28:37 +0800
commite836c4b9e78cc3892cdebf8126cb650f1b91ed37 (patch)
tree4e52155aef0105cc9b888a42b3e760455a2bcb36 /_log/neo4j-a-star-search.md
parent57ff09d2eefefa2462a2af0175e3e8164c7bc828 (diff)
downloadwww-e836c4b9e78cc3892cdebf8126cb650f1b91ed37.tar.gz
Tighten prose.
Diffstat (limited to '_log/neo4j-a-star-search.md')
-rw-r--r--_log/neo4j-a-star-search.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/_log/neo4j-a-star-search.md b/_log/neo4j-a-star-search.md
index de0ef25..db74444 100644
--- a/_log/neo4j-a-star-search.md
+++ b/_log/neo4j-a-star-search.md
@@ -4,8 +4,8 @@ date: 2018-03-06
layout: post
---
-Work project. Marine vessel tracking with Neo4J hit a limit. Need to store
-13,000 route points; Dijkstra's shortest path search slows after 4,000.
+Work. Vessel tracking with Neo4J hit a limit. Need to analyze 13,000 route
+points; Dijkstra's shortest path search slows after 4,000.
Replaced Dijkstra's algorithm with A* search using haversine function as
heuristic:
@@ -48,7 +48,7 @@ private void updateCosts(
}
```
-Outcome: 300x speedup. Scaled to 13,000 route points.
+300x speedup. Scaled to 13,000 route points.
Upstreamed changes: <a
href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/releases/tag/3.4.0.0"