diff options
| author | Sadeep Madurange <sadeep@asciimx.com> | 2026-06-05 21:00:02 +0800 |
|---|---|---|
| committer | Sadeep Madurange <sadeep@asciimx.com> | 2026-06-12 19:49:59 +0800 |
| commit | a8d7508006db8309550755a72719de83bde3cdd9 (patch) | |
| tree | f641b17405c674d3799ebca1f135538bfc930b7d /_log/neo4j-a-star-search.md | |
| parent | 293923a31d434c37cae454a4f1d9977772d11f02 (diff) | |
| download | www-a8d7508006db8309550755a72719de83bde3cdd9.tar.gz | |
Improve writing.minimalist
Diffstat (limited to '_log/neo4j-a-star-search.md')
| -rw-r--r-- | _log/neo4j-a-star-search.md | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/_log/neo4j-a-star-search.md b/_log/neo4j-a-star-search.md index 21f09b5..3ab0b69 100644 --- a/_log/neo4j-a-star-search.md +++ b/_log/neo4j-a-star-search.md @@ -9,7 +9,9 @@ Written in 2026, backdated to 2018. Before v3.4.0, Neo4J algorithms plugin shipped with Dijkstra's shortest path search. The algorithm was too slow for our marine vessel tracking application. -Forked and added A* search. Used the haversine function to steer the search: +Forked the project and added the A* search algorithm. + +Haversine function steers the search: ``` private double computeHeuristic( @@ -33,7 +35,7 @@ private double computeHeuristic( } ``` -Core search loop updates costs when a better path is found: +When a better path is found, the core search loop updates the costs: ``` private void updateCosts( |