Use NEO4J To Find The Shortest Path

By Khalid Abuhakmeh’s Blog - 2020-04-28

Description

Use the graph database, NEO4J, to find the shortest path between any two nodes. Code samples included.

Summary

  • Relational databases are the undisputed database paradigm king.
  • A store node may have an address, while its relationship with a shipping location may include a shipping agreement.
  • Cypher is a powerful query language, and as shown by the example in this post, we can perform complex requests with very minimal syntax.

 

Topics

  1. Database (0.48)
  2. Backend (0.11)
  3. Machine_Learning (0.04)

Similar Articles

QuickGraph#17 The English WordNet in Neo4j (part 2)

By Jesús Barrasa - 2021-02-05

In this second post on WordNet on Neo4j I will be focusing on querying and analysing the graph that we created in the previous post. I'll leave for a third one more advanced analysis and integrations ...

7 Ways Your Data Is Telling You It’s a Graph

By Neo4j Graph Database Platform - 2015-12-23

Watch (or read) Senior Project Manager Karen Lopez’s GraphConnect presentation on the signs that your data is actually a graph and needs a graph database.

What was the data approach to breaking The FinCEN Files?

By diginomica - 2020-09-24

How do you work backwards from thousands of disconnected PDFs to the 100,000 suspicious financial transactions they’re reporting on? A combination of hard human work, OCR, data analysis and graph.