Copyright © 2019 Neo4j, Inc.

License: Creative Commons 4.0

This is the user guide for Neo4j Graph Algorithms version 3.5, authored by the Neo4j Team.

The guide covers the following areas:

- Chapter 1,
*Introduction*— An introduction to Neo4j Graph Algorithms. - Chapter 2,
*Projected Graph Model*— A detailed guide to the projected graph model. - Chapter 3,
*The Yelp example*— An illustration of how to use graph algorithms on a social network of friends. - Chapter 4,
*Procedures*— A list of Neo4j Graph Algorithm procedures. - Chapter 5,
*Centrality algorithms*— A detailed guide to each of the centrality algorithms, including use-cases and examples. - Chapter 6,
*Community detection algorithms*— A detailed guide to each of the community detection algorithms, including use-cases and examples. - Chapter 7,
*Path finding algorithms*— A detailed guide to each of the path finding algorithms, including use-cases and examples. - Chapter 8,
*Similarity algorithms*— A detailed guide to each of the similarity algorithms, including use-cases and examples. - Chapter 9,
*Link Prediction algorithms*— A detailed guide to each of the link prediction algorithms, including use-cases and examples. - Chapter 10,
*Preprocessing functions and procedures*— A detailed guide to each of the preprocessing functions and procedures.

Graph Algorithms: Practical Examples in Apache Spark and Neo4j, by Mark Needham & Amy E. Hodler and published by O’Reilly Media is available now.

Download it for free at neo4j.com/graph-algorithms-book/.