summaryrefslogtreecommitdiffstats
path: root/_log/neo4j-a-star-search.md
diff options
context:
space:
mode:
Diffstat (limited to '_log/neo4j-a-star-search.md')
-rw-r--r--_log/neo4j-a-star-search.md6
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(