diff options
Diffstat (limited to '_site/archive/neo4j-a-star-search')
| -rw-r--r-- | _site/archive/neo4j-a-star-search/index.html | 14 |
1 files changed, 8 insertions, 6 deletions
diff --git a/_site/archive/neo4j-a-star-search/index.html b/_site/archive/neo4j-a-star-search/index.html index 353ab6f..6d3bac3 100644 --- a/_site/archive/neo4j-a-star-search/index.html +++ b/_site/archive/neo4j-a-star-search/index.html @@ -40,10 +40,11 @@ <main> <div class="container"> - <h2 class="center" id="title">NEO4J A* SEARCH</h2> - <h6 class="center">14 SEPTEMBER 2025</h5> - <br> - <div class="twocol justify"><p>Back in 2018, we used <a href="https://neo4j.com/" class="external" target="_blank" rel="noopener noreferrer">Neo4J</a> graph database to track the + <div class="container-2"> + <h2 class="center" id="title">NEO4J A* SEARCH</h2> + <h6 class="center">14 SEPTEMBER 2025</h5> + <br> + <div class="twocol justify"><p>Back in 2018, we used <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. Algorithms based on graph theory, such as A* search, provide an optimal solution to this @@ -351,13 +352,14 @@ enabling us to expand our search from 4,000 to 13,000 route points. The <a href= Neo4J graph algorithms shipped with the A* search algorithm.</p> </div> - <p class="post-author right">by Wickramage Don Sadeep Madurange</p> + <p class="post-author right">by Wickramage Don Sadeep Madurange</p> + </div> </div> </main> <div class="footer"> <div class="container"> - <div class="twelve columns right"> + <div class="twelve columns right container-2"> <p id="footer-text">© ASCIIMX - 2025</p> </div> </div> |