gives the Jaccard similarity between vertices u and v of the graph g.

uses rules to specify the graph g.


  • The vertex Jaccard similarity is also known as Jaccard index and Jaccard similarity coefficient.
  • The vertex Jaccard similarity between u and v is the number of common neighbors of u and v divided by the number of vertices that are neighbors of u or v.
  • VertexJaccardSimilarity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Introduced in 2012
| Updated in 2015
Translate this page: