From d18b728cb306de19b9d60d6226d5d27843ecc585 Mon Sep 17 00:00:00 2001 From: Sadeep Madurange Date: Sun, 16 Nov 2025 14:58:12 +0800 Subject: Minor improvements to posts. --- _archive/neo4j-a-star-search.md | 20 ++++++++------------ _projects/fpm-door-lock.md | 2 +- _site/archive/neo4j-a-star-search/index.html | 18 +++++++----------- _site/feed.xml | 2 +- _site/posts.xml | 2 +- _site/projects/fpm-door-lock/index.html | 2 +- 6 files changed, 19 insertions(+), 27 deletions(-) diff --git a/_archive/neo4j-a-star-search.md b/_archive/neo4j-a-star-search.md index aae34b9..4db68d6 100644 --- a/_archive/neo4j-a-star-search.md +++ b/_archive/neo4j-a-star-search.md @@ -13,13 +13,11 @@ Performance issues with Neo4J’s shortest-path algorithms limited our search to about 4,000 route points. A graph is a finite set of vertices, and a subset of vertex pairs known as -edges. Edges can have weights. - -In the case of vessel tracking, the route points can be modeled as a graph -with the distances between them as weights. For different reasons, people are -interested in 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. +edges. Edges can have weights. In the case of vessel tracking, the route points +can be modeled as a graph with the distances between them as weights. For +different reasons, people are interested in 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. Dijkstra's algorithm is one such algorithm that finds the shortest path between two vertices. The one drawback of this algorithm is that it computes all the @@ -309,10 +307,8 @@ public class ShortestPathAStar extends Algorithm { ``` The heuristic function is domain-specific. If chosen wisely, it can significantly speed up the search. In our case, we achieved a 300x speedup, -enabling us to expand our search from 4,000 to 13,000 route points. - -The Neo4J graph algorithms open-source project v3.4 shipped -with my implementation of the A* search algorithm. +class="external" target="_blank" rel="noopener noreferrer">v3.4.0 of the +Neo4J graph algorithms shipped with the A* search algorithm. diff --git a/_projects/fpm-door-lock.md b/_projects/fpm-door-lock.md index 19afa40..2725f36 100644 --- a/_projects/fpm-door-lock.md +++ b/_projects/fpm-door-lock.md @@ -54,7 +54,7 @@ The source code of the project, which includes a driver for the R503 fingerprint sensor module, is enclosed in the tarball linked at the end of the page. -## The circuit board +## The PCB For this project, I designed a custom PCB and had it fabricated by JLCPCB. Like the software, the circuit is chiefly concerned with optimizing power diff --git a/_site/archive/neo4j-a-star-search/index.html b/_site/archive/neo4j-a-star-search/index.html index 92d350d..826ea2c 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -50,13 +50,11 @@ Performance issues with Neo4J’s shortest-path algorithms limited our search to about 4,000 route points.

A graph is a finite set of vertices, and a subset of vertex pairs known as -edges. Edges can have weights.

- -

In the case of vessel tracking, the route points can be modeled as a graph -with the distances between them as weights. For different reasons, people are -interested in 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.

+edges. Edges can have weights. In the case of vessel tracking, the route points +can be modeled as a graph with the distances between them as weights. For +different reasons, people are interested in 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.

Dijkstra’s algorithm is one such algorithm that finds the shortest path between two vertices. The one drawback of this algorithm is that it computes all the @@ -345,10 +343,8 @@ public class ShortestPathAStar extends Algorithm<ShortestPathAStar> {

The heuristic function is domain-specific. If chosen wisely, it can significantly speed up the search. In our case, we achieved a 300x speedup, -enabling us to expand our search from 4,000 to 13,000 route points.

- -

The Neo4J graph algorithms open-source project v3.4 shipped -with my implementation of the A* search algorithm.

+enabling us to expand our search from 4,000 to 13,000 route points. The v3.4.0 of the +Neo4J graph algorithms shipped with the A* search algorithm.

by Wickramage Don Sadeep Madurange

diff --git a/_site/feed.xml b/_site/feed.xml index f4a1df1..6c19f3d 100644 --- a/_site/feed.xml +++ b/_site/feed.xml @@ -1 +1 @@ -Jekyll2025-11-12T21:42:47+08:00/feed.xmlASCIIMX | ArchiveWickramage Don Sadeep MadurangeNeo4J A* search2025-09-14T00:00:00+08:002025-09-14T00:00:00+08:00/archive/neo4j-a-star-searchWickramage Don Sadeep MadurangeMOSFETs2025-06-22T00:00:00+08:002025-06-22T00:00:00+08:00/archive/mosfet-switchesWickramage Don Sadeep MadurangeATmega328P chips2025-04-10T00:00:00+08:002025-04-10T00:00:00+08:00/archive/arduino-unoWickramage Don Sadeep MadurangeBare-metal ATSAM3X8E chips2024-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-11-16T14:57:59+08:00http://localhost:4000/feed.xmlASCIIMX | ArchiveWickramage Don Sadeep MadurangeNeo4J A* search2025-09-14T00:00:00+08:002025-09-14T00:00:00+08:00http://localhost:4000/archive/neo4j-a-star-searchWickramage Don Sadeep MadurangeMOSFETs2025-06-22T00:00:00+08:002025-06-22T00:00:00+08:00http://localhost:4000/archive/mosfet-switchesWickramage Don Sadeep MadurangeATmega328P chips2025-04-10T00:00:00+08:002025-04-10T00:00:00+08:00http://localhost:4000/archive/arduino-unoWickramage Don Sadeep MadurangeBare-metal ATSAM3X8E chips2024-10-05T00:00:00+08:002024-10-05T00:00:00+08:00http://localhost:4000/archive/arduino-dueWickramage Don Sadeep Madurange \ No newline at end of file diff --git a/_site/posts.xml b/_site/posts.xml index 837fb10..278003a 100644 --- a/_site/posts.xml +++ b/_site/posts.xml @@ -1 +1 @@ -Jekyll2025-11-12T21:42:47+08:00/posts.xmlASCIIMXWickramage Don Sadeep Madurange \ No newline at end of file +Jekyll2025-11-16T14:57:59+08:00http://localhost:4000/posts.xmlASCIIMXWickramage Don Sadeep Madurange \ No newline at end of file diff --git a/_site/projects/fpm-door-lock/index.html b/_site/projects/fpm-door-lock/index.html index cfa3287..66a578d 100644 --- a/_site/projects/fpm-door-lock/index.html +++ b/_site/projects/fpm-door-lock/index.html @@ -91,7 +91,7 @@ physical world around you by uttering a few lines of C code.

fingerprint sensor module, is enclosed in the tarball linked at the end of the page.

-

The circuit board

+

The PCB

For this project, I designed a custom PCB and had it fabricated by JLCPCB. Like the software, the circuit is chiefly concerned with optimizing power -- cgit v1.2.3