This chapter provides explanations and examples for each of the link prediction algorithms in the Neo4j Labs Graph Algorithms library.

This is documentation for the Graph Algorithms Library, which has been deprecated by the Graph Data Science Library (GDS). |

These algorithms help determine the closeness of a pair of nodes. We would then use the computed scores as part of a link prediction solution:

- Adamic Adar (
`algo.linkprediction.adamicAdar`

) - Common Neighbors (
`algo.linkprediction.commonNeighbors`

) - Preferential Attachment (
`algo.linkprediction.preferentialAttachment`

) - Resource Allocation (
`algo.linkprediction.resourceAllocation`

) - Same Community (
`algo.linkprediction.sameCommunity`

) - Total Neighbors (
`algo.linkprediction.totalNeighbors`

)