diff options
Diffstat (limited to '_archive')
| -rw-r--r-- | _archive/neo4j-a-star-search.md | 20 |
1 files changed, 8 insertions, 12 deletions
diff --git a/_archive/neo4j-a-star-search.md b/_archive/neo4j-a-star-search.md index aae34b9..4db68d6 100644 --- a/_archive/neo4j-a-star-search.md +++ b/_archive/neo4j-a-star-search.md @@ -13,13 +13,11 @@ Performance issues with Neo4J’s shortest-path algorithms limited our search to about 4,000 route points. A graph is a finite set of vertices, and a subset of vertex pairs known as -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. +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. 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 @@ -309,10 +307,8 @@ public class ShortestPathAStar extends Algorithm<ShortestPathAStar> { ``` 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. - -The Neo4J graph algorithms open-source project <a +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</a> shipped -with my implementation of the A* search algorithm. +class="external" target="_blank" rel="noopener noreferrer">v3.4.0</a> of the +Neo4J graph algorithms shipped with the A* search algorithm. |