/top-n-similar-nodes-in-unweighted-undirected-graph

Function to find top N similar nodes in an un-weighted un-directed graph.

Primary LanguageJavaMIT LicenseMIT

top-n-similar-nodes-in-unweighted-undirected-graph

Function to find top N similar nodes in an un-weighted un-directed graph.

Usage

1. Build the graph
2. Call `getHighestRatedNodes`

Example usage

To see an example run Main.main