summaryrefslogtreecommitdiffstats
path: root/_site/log/neo4j-a-star-search/index.html
diff options
context:
space:
mode:
Diffstat (limited to '_site/log/neo4j-a-star-search/index.html')
-rw-r--r--_site/log/neo4j-a-star-search/index.html6
1 files changed, 3 insertions, 3 deletions
diff --git a/_site/log/neo4j-a-star-search/index.html b/_site/log/neo4j-a-star-search/index.html
index 152531d..2063d68 100644
--- a/_site/log/neo4j-a-star-search/index.html
+++ b/_site/log/neo4j-a-star-search/index.html
@@ -40,8 +40,8 @@
<h2 class="center" id="title">NEO4J PATH TRAVERSAL: A* OPTIMIZATION</h2>
<h5 class="center">06 MARCH 2018</h5>
<br>
- <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>
+ <div class="twocol justify"><p>Work. Vessel tracking with Neo4J hit a limit. Need to analyze 13,000 route
+points; Dijkstra’s shortest path search slows after 4,000.</p>
<p>Replaced Dijkstra’s algorithm with A* search using haversine function as
heuristic:</p>
@@ -82,7 +82,7 @@ heuristic:</p>
}
</code></pre></div></div>
-<p>Outcome: 300x speedup. Scaled to 13,000 route points.</p>
+<p>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