From 2c3d7cd47104017f3858ee79fbd6976046448dab Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Sat, 6 Dec 2025 21:14:22 +0800 Subject: Neo4J. --- _site/archive/neo4j-a-star-search/index.html | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) (limited to '_site/archive/neo4j-a-star-search') 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 @@

Back in 2018, we used Neo4J 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 -- cgit v1.2.3