From d6205d87b2c626a4fb2414d7c1746ada3467d79d Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Sun, 7 Dec 2025 17:48:36 +0800 Subject: Neo4J. --- _archive/neo4j-a-star-search.md | 6 +++--- _site/archive/neo4j-a-star-search/index.html | 6 +++--- _site/feed.xml | 2 +- _site/posts.xml | 2 +- 4 files changed, 8 insertions(+), 8 deletions(-) diff --git a/_archive/neo4j-a-star-search.md b/_archive/neo4j-a-star-search.md index 8fbf67a..dba67f2 100644 --- a/_archive/neo4j-a-star-search.md +++ b/_archive/neo4j-a-star-search.md @@ -21,9 +21,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. 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.

diff --git a/_site/feed.xml b/_site/feed.xml index 58717b3..af86b51 100644 --- a/_site/feed.xml +++ b/_site/feed.xml @@ -1 +1 @@ -Jekyll2025-12-07T17:45:32+08:00/feed.xmlASCIIMX | ArchiveWickramage Don Sadeep MadurangeHow I manage Suckless software packages2025-11-30T00:00:00+08:002025-11-30T00:00:00+08:00/archive/suckless-softwareWickramage Don Sadeep MadurangeNeo4J A* search2025-09-14T00:00:00+08:002025-09-14T00:00:00+08:00/archive/neo4j-a-star-searchWickramage Don Sadeep MadurangeMOSFETs as electronic switches2025-06-22T00:00:00+08:002025-06-22T00:00:00+08:00/archive/mosfet-switchesWickramage Don Sadeep MadurangeHow to configure ATmega328P microcontrollers to run at 3.3V and 5V2025-04-10T00:00:00+08:002025-04-10T00:00:00+08:00/archive/arduino-unoWickramage Don Sadeep MadurangeHow to set up ATSAM3X8E microcontrollers for bare-metal programming in C2024-10-05T00:00:00+08:002024-10-05T00:00:00+08:00/archive/arduino-dueWickramage Don Sadeep Madurange \ No newline at end of file +Jekyll2025-12-07T17:48:20+08:00/feed.xmlASCIIMX | ArchiveWickramage Don Sadeep MadurangeHow I manage Suckless software packages2025-11-30T00:00:00+08:002025-11-30T00:00:00+08:00/archive/suckless-softwareWickramage Don Sadeep MadurangeNeo4J A* search2025-09-14T00:00:00+08:002025-09-14T00:00:00+08:00/archive/neo4j-a-star-searchWickramage Don Sadeep MadurangeMOSFETs as electronic switches2025-06-22T00:00:00+08:002025-06-22T00:00:00+08:00/archive/mosfet-switchesWickramage Don Sadeep MadurangeHow to configure ATmega328P microcontrollers to run at 3.3V and 5V2025-04-10T00:00:00+08:002025-04-10T00:00:00+08:00/archive/arduino-unoWickramage Don Sadeep MadurangeHow to set up ATSAM3X8E microcontrollers for bare-metal programming in C2024-10-05T00:00:00+08:002024-10-05T00:00:00+08:00/archive/arduino-dueWickramage Don Sadeep Madurange \ No newline at end of file diff --git a/_site/posts.xml b/_site/posts.xml index 2bc9d82..c3ebfa5 100644 --- a/_site/posts.xml +++ b/_site/posts.xml @@ -1 +1 @@ -Jekyll2025-12-07T17:45:32+08:00/posts.xmlASCIIMXWickramage Don Sadeep Madurange \ No newline at end of file +Jekyll2025-12-07T17:48:20+08:00/posts.xmlASCIIMXWickramage Don Sadeep Madurange \ No newline at end of file -- cgit v1.2.3