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

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`

)