% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{centrality_bottleneck}
\alias{centrality_bottleneck}
\title{Bottleneck Centrality}
\usage{
centrality_bottleneck(x, mode = "all", ...)
}
\arguments{
\item{x}{Network input (matrix, igraph, network, cograph_network, tna object).}

\item{mode}{For directed networks: \code{"all"} (default), \code{"in"}, or
\code{"out"}.}

\item{...}{Additional arguments passed to \code{\link{centrality}} (e.g.,
\code{normalized}, \code{weighted}, \code{directed}).}
}
\value{
Named integer vector of bottleneck centrality values.
}
\description{
Number of shortest path trees where the node appears in more than n/4 paths.
}
\examples{
adj <- matrix(c(0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0), 4, 4)
rownames(adj) <- colnames(adj) <- c("A", "B", "C", "D")
centrality_bottleneck(adj)
}
\seealso{
\code{\link{centrality}} for computing multiple measures at once.
}
