File: subgraph.centrality.Rd

package info (click to toggle)
r-cran-igraph 2.1.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 27,044 kB
  • sloc: ansic: 204,981; cpp: 21,711; fortran: 4,090; yacc: 1,229; lex: 519; sh: 52; makefile: 8
file content (22 lines) | stat: -rw-r--r-- 854 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/centrality.R
\name{subgraph.centrality}
\alias{subgraph.centrality}
\title{Find subgraph centrality scores of network positions}
\usage{
subgraph.centrality(graph, diag = FALSE)
}
\arguments{
\item{graph}{The input graph. It will be treated as undirected.}

\item{diag}{Boolean scalar, whether to include the diagonal of the adjacency
matrix in the analysis. Giving \code{FALSE} here effectively eliminates the
loops edges from the graph before the calculation.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{subgraph.centrality()} was renamed to \code{subgraph_centrality()} to create a more
consistent API.
}
\keyword{internal}