gives the Dice similarity between vertices u and v of the graph g.
uses rules vw to specify the graph g.
- The vertex Dice similarity is the number of common neighbors of u and v divided by half the sum of the degrees of u and v.
- VertexDiceSimilarity works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
Introduced in 2012
(9.0)| Updated in 2015