Chapter 20. Graph Algorithms

Neo4j graph algorithms is a component that contains Neo4j implementations of some common algorithms for graphs. It includes algorithms like:

  • Shortest paths,
  • all paths,
  • all simple paths,
  • Dijkstra and
  • A*.

The graph algorithms are included with Neo4j.

For usage examples, see Section 21.18, “Graph Algorithms” (REST API) and Section 34.11, “Graph Algorithm examples” (embedded database). The shortest path algorithm can be used from Cypher as well, see the section called “Shortest path”.