© {copyright}
License: Creative Commons 4.0
This is the user guide for Neo4j Graph Algorithms version {docs-version}, authored by the Neo4j Team.
The guide covers the following areas:
-
Introduction — An introduction to Neo4j Graph Algorithms.
-
[projected-graph-model] — A detailed guide to the projected graph model.
-
The Yelp example — An illustration of how to use graph algorithms on a social network of friends.
-
Procedures — A list of Neo4j Graph Algorithm procedures.
-
[algorithms-centrality] — A detailed guide to each of the centrality algorithms, including use-cases and examples.
-
[algorithms-community] — A detailed guide to each of the community detection algorithms, including use-cases and examples.
-
[algorithms-path-finding] — A detailed guide to each of the path finding algorithms, including use-cases and examples.
-
[algorithms-similarity] — A detailed guide to each of the similarity algorithms, including use-cases and examples.
-
[algorithms-linkprediction] — A detailed guide to each of the link prediction algorithms, including use-cases and examples.
-
[algorithms-preprocessing] — A detailed guide to each of the preprocessing functions and procedures.
In April 2019 O’Reilly published the Graph Algorithms Book, with practical examples in Apache Spark and Neo4j.
This chapter provides an introduction to the available graph algorithms, and instructions for installation and use.
This chapter introduces the Yelp Open Dataset that is used throughout to exemplify how the Neo4j Graph Algorithms work.
This chapter contains a reference of all the procedures in the Neo4j Graph Algorithms library.