diff options
| author | Sadeep Madurange <sadeep@asciimx.com> | 2026-01-04 18:17:43 +0800 |
|---|---|---|
| committer | Sadeep Madurange <sadeep@asciimx.com> | 2026-01-04 22:40:51 +0800 |
| commit | 75aa500d7644f15f4a45fe2f64de1c526b87cf95 (patch) | |
| tree | ef8579b87a6b76a596ccd288cd1e7f3062f64dac /_site/log/neo4j-a-star-search/index.html | |
| parent | 1a4a6cb6d2aa2c8512e9637dc5dd95997321c444 (diff) | |
| download | www-75aa500d7644f15f4a45fe2f64de1c526b87cf95.tar.gz | |
Neo4J post update.
Diffstat (limited to '_site/log/neo4j-a-star-search/index.html')
| -rw-r--r-- | _site/log/neo4j-a-star-search/index.html | 17 |
1 files changed, 9 insertions, 8 deletions
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 @@ <h2 class="center" id="title">NEO4J SHORTEST PATH OPTIMIZATION</h2> <h5 class="center">06 MARCH 2018</h5> <br> - <div class="twocol justify"><p>Replaced Dijkstra’s search for vessel route tracking in Neo4J.</p> + <div class="twocol justify"><p>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.</p> -<p>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.</p> - -<p>Implemented A* search using haversine function as heuristic:</p> +<p>Replaced Dijkstra’s algorithm with A* search using haversine function as +heuristic:</p> <div class="language-plaintext highlighter-rouge"><div class="highlight"><pre class="highlight"><code>private double computeHeuristic( final double lat1, final double lon1, @@ -84,8 +82,11 @@ points.</p> } </code></pre></div></div> -<p>Outcome: 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" class="external" target="_blank" rel="noopener noreferrer">Neo4J v3.4.0</a>. -<a href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/blob/bd9732d9a690319552e134708692acb5a0d6b37c/algo/src/main/java/org/neo4j/graphalgo/impl/ShortestPathAStar.java">Full source</a></p> +<p>Outcome: 300x speedup. Scaled to 13,000 route points.</p> + +<p>Upstreamed changes: <a href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/releases/tag/3.4.0.0" class="external" target="_blank" rel="noopener noreferrer">Neo4J v3.4.0</a> | +<a href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/blob/bd9732d9a690319552e134708692acb5a0d6b37c/algo/src/main/java/org/neo4j/graphalgo/impl/ShortestPathAStar.java">Full +source</a></p> </div> <p class="post-author right">by W. D. Sadeep Madurange</p> </div> |