1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{estimate_closeness}
\alias{estimate_closeness}
\title{Deprecated version of \code{closeness()}}
\usage{
estimate_closeness(
graph,
vids = V(graph),
mode = c("out", "in", "all", "total"),
cutoff,
weights = NULL,
normalized = FALSE
)
}
\arguments{
\item{graph}{The graph to analyze.}
\item{vids}{The vertices for which closeness will be calculated.}
\item{mode}{Character string, defined the types of the paths used for
measuring the distance in directed graphs. \dQuote{in} measures the paths
\emph{to} a vertex, \dQuote{out} measures paths \emph{from} a vertex,
\emph{all} uses undirected paths. This argument is ignored for undirected
graphs.}
\item{cutoff}{The maximum path length to consider when calculating the
closeness. If zero or negative then there is no such limit.}
\item{weights}{Optional positive weight vector for calculating weighted
closeness. If the graph has a \code{weight} edge attribute, then this is
used by default. Weights are used for calculating weighted shortest
paths, so they are interpreted as distances.}
\item{normalized}{Logical scalar, whether to calculate the normalized
closeness, i.e. the inverse average distance to all reachable vertices.
The non-normalized closeness is the inverse of the sum of distances to
all reachable vertices.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
Use \code{\link[=closeness]{closeness()}} with the \code{cutoff} argument instead.
}
\keyword{internal}
|
