From 75aa500d7644f15f4a45fe2f64de1c526b87cf95 Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Sun, 4 Jan 2026 18:17:43 +0800 Subject: Neo4J post update. --- _site/log/neo4j-a-star-search/index.html | 17 +++++++++-------- 1 file changed, 9 insertions(+), 8 deletions(-) (limited to '_site/log/neo4j-a-star-search/index.html') diff --git a/_site/log/neo4j-a-star-search/index.html b/_site/log/neo4j-a-star-search/index.html index 00f7886..c8c4ce6 100644 --- a/_site/log/neo4j-a-star-search/index.html +++ b/_site/log/neo4j-a-star-search/index.html @@ -40,13 +40,11 @@

NEO4J SHORTEST PATH OPTIMIZATION

06 MARCH 2018

-

Replaced Dijkstra’s search for vessel route tracking in Neo4J.

+

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.

-

Tracking 13,000 marine vessel route points. Needed shortest paths between ports -for arrival prediction. Neo4j’s Dijkstra’s algorithm slows after 4,000 route -points.

- -

Implemented A* search using haversine function as heuristic:

+

Replaced Dijkstra’s algorithm with A* search using haversine function as +heuristic:

private double computeHeuristic(
     final double lat1, final double lon1,
@@ -84,8 +82,11 @@ points.

 }
-

Outcome: 300x speedup. Scaled to 13,000 route points. Upstreamed changes. Neo4J v3.4.0. -Full source

+

Outcome: 300x speedup. Scaled to 13,000 route points.

+ +

Upstreamed changes: Neo4J v3.4.0 | +Full +source

by W. D. Sadeep Madurange

-- cgit v1.2.3