diff options
| author | Sadeep Madurange <sadeep@asciimx.com> | 2025-10-27 18:10:51 +0800 |
|---|---|---|
| committer | Sadeep Madurange <sadeep@asciimx.com> | 2025-10-27 21:10:18 +0800 |
| commit | f7300455cb61c1c22eeaee7139eac7c39a723e25 (patch) | |
| tree | b1e663b4a84053d94c34eeb5cdb498f3d80b12a9 /_site/archive/neo4j-a-star-search | |
| parent | f6d945cd589921886508f7e4338bd4549dab28d3 (diff) | |
| download | www-marat.tar.gz | |
Improve styling for links, code.marat
Diffstat (limited to '_site/archive/neo4j-a-star-search')
| -rw-r--r-- | _site/archive/neo4j-a-star-search/index.html | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/_site/archive/neo4j-a-star-search/index.html b/_site/archive/neo4j-a-star-search/index.html index f863b61..7be729b 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -21,18 +21,18 @@ <ul id="navlist" class="left"> <li > - <a href="/">hme</a> + <a href="/" class="link-decor-none">hme</a> </li> <li class="active"> - <a href="/archive/">arc</a> + <a href="/archive/" class="link-decor-none">blg</a> </li> <li > - <a href="/projects/">prj</a> + <a href="/projects/" class="link-decor-none">poc</a> </li> <li > - <a href="/about/">abt</a> + <a href="/about/" class="link-decor-none">abt</a> </li> - <li><a href="/feed.xml">rss</a></li> + <li><a href="/feed.xml" class="link-decor-none">rss</a></li> </ul> </div> @@ -43,7 +43,7 @@ <h2 class="center" id="title">NEO4J A* SEARCH</h2> <h6 class="center">14 SEPTEMBER 2025</h5> <br> - <div class="threecol justify"><p>Back in 2018, we used the <a src="https://neo4j.com/" class="external" target="_blank" rel="noopener noreferrer">Neo4J</a> graph database + <div class="threecol justify"><p>Back in 2018, we used the <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. Performance issues with Neo4J’s then-available shortest-path algorithms limited |