diff options
Diffstat (limited to '_site/archive/neo4j-a-star-search')
| -rw-r--r-- | _site/archive/neo4j-a-star-search/index.html | 18 |
1 files changed, 7 insertions, 11 deletions
diff --git a/_site/archive/neo4j-a-star-search/index.html b/_site/archive/neo4j-a-star-search/index.html index 92d350d..826ea2c 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -50,13 +50,11 @@ Performance issues with Neo4J’s shortest-path algorithms limited our search to about 4,000 route points.</p> <p>A graph is a finite set of vertices, and a subset of vertex pairs known as -edges. Edges can have weights.</p> - -<p>In the case of vessel tracking, the route points can be modeled as a graph -with the distances between them as weights. For different reasons, people are -interested in minimizing (or maximizing) the weight of a path through a set of -vertices. For instance, we may want to find the shortest path between two -ports.</p> +edges. Edges can have weights. In the case of vessel tracking, the route points +can be modeled as a graph with the distances between them as weights. For +different reasons, people are interested in minimizing (or maximizing) the +weight of a path through a set of vertices. For instance, we may want to find +the shortest path between two ports.</p> <p>Dijkstra’s algorithm is one such algorithm that finds the shortest path between two vertices. The one drawback of this algorithm is that it computes all the @@ -345,10 +343,8 @@ public class ShortestPathAStar extends Algorithm<ShortestPathAStar> { </code></pre></div></div> <p>The heuristic function is domain-specific. If chosen wisely, it can significantly speed up the search. In our case, we achieved a 300x speedup, -enabling us to expand our search from 4,000 to 13,000 route points.</p> - -<p>The Neo4J graph algorithms open-source project <a href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/releases/tag/3.4.0.0" class="external" target="_blank" rel="noopener noreferrer">v3.4</a> shipped -with my implementation of the A* search algorithm.</p> +enabling us to expand our search from 4,000 to 13,000 route points. The <a href="https://github.com/neo4j-contrib/neo4j-graph-algorithms/releases/tag/3.4.0.0" class="external" target="_blank" rel="noopener noreferrer">v3.4.0</a> of the +Neo4J graph algorithms shipped with the A* search algorithm.</p> </div> <p class="post-author right">by Wickramage Don Sadeep Madurange</p> |