% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/similarity.R
\name{similarity.dice}
\alias{similarity.dice}
\title{Similarity measures of two vertices (Dice)}
\usage{
similarity.dice(
  graph,
  vids = V(graph),
  mode = c("all", "out", "in", "total"),
  loops = FALSE
)
}
\arguments{
\item{graph}{The input graph.}

\item{vids}{The vertex ids for which the similarity is calculated.}

\item{mode}{The type of neighboring vertices to use for the calculation,
possible values: \sQuote{\code{out}}, \sQuote{\verb{in}},
\sQuote{\code{all}}.}

\item{loops}{Whether to include vertices themselves in the neighbor
sets.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

Please use \code{\link[=similarity]{similarity()}} with \code{method = "dice"} instead.
}
\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
}

\keyword{internal}
