From d6205d87b2c626a4fb2414d7c1746ada3467d79d Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Sun, 7 Dec 2025 17:48:36 +0800 Subject: Neo4J. --- _site/archive/neo4j-a-star-search/index.html | 6 +++--- 1 file changed, 3 insertions(+), 3 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 32b70b7..1b23967 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -59,9 +59,9 @@ 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.

Given such a graph, an algorithm like Dijkstra’s search could compute the -shortest path between two vertices. In fact, this was the algorithm the Neo4J -project shipped with at the time. One drawback of Dijkstra’s algorithm is that -it computes all the shortest paths from the source to all other vertices before +shortest path between two vertices. In fact, this was the algorithm Neo4J +shipped with at the time. One drawback of Dijkstra’s algorithm is that it +computes all the shortest paths from the source to all other vertices before terminating at the destination vertex. The exhaustive nature of this search limited our search to about 4,000 route points.

-- cgit v1.2.3