diff options
Diffstat (limited to '_archive')
| -rw-r--r-- | _archive/neo4j-a-star-search.md | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/_archive/neo4j-a-star-search.md b/_archive/neo4j-a-star-search.md index bbe80a6..8fbf67a 100644 --- a/_archive/neo4j-a-star-search.md +++ b/_archive/neo4j-a-star-search.md @@ -9,8 +9,9 @@ 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. +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. 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 |