diff options
| author | Sadeep Madurange <sadeep@asciimx.com> | 2025-12-06 21:14:22 +0800 |
|---|---|---|
| committer | Sadeep Madurange <sadeep@asciimx.com> | 2025-12-06 21:14:22 +0800 |
| commit | 2c3d7cd47104017f3858ee79fbd6976046448dab (patch) | |
| tree | aeb62aef51eb40c7e89f08751789d5eedb065c90 /_site/archive/neo4j-a-star-search | |
| parent | f33c398584f1777413d063182b0a22d6c1fd8610 (diff) | |
| download | www-2c3d7cd47104017f3858ee79fbd6976046448dab.tar.gz | |
Neo4J.
Diffstat (limited to '_site/archive/neo4j-a-star-search')
| -rw-r--r-- | _site/archive/neo4j-a-star-search/index.html | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/_site/archive/neo4j-a-star-search/index.html b/_site/archive/neo4j-a-star-search/index.html index 6d3bac3..32b70b7 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -47,8 +47,9 @@ <div class="twocol justify"><p>Back in 2018, we used <a href="https://neo4j.com/" class="external" target="_blank" rel="noopener noreferrer">Neo4J</a> graph database to track the movement of marine vessels. We were interested in the shortest path a ship could take through a network of about 13,000 route points. Algorithms based on -graph theory, such as A* search, provide an optimal solution to this -problem. Therefore, it was useful to model the set of route points as a graph.</p> +graph theory, such as A* search, provide optimal solutions to such problems. +In other words, the set of route points lends itself well to a model based on +graphs.</p> <p>A graph is a finite set of vertices, and a subset of vertex pairs (edges). Edges can have weights. In the case of vessel tracking, the route points form |