% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/network-summary.R
\name{network_girth}
\alias{network_girth}
\title{Network Girth (Shortest Cycle Length)}
\usage{
network_girth(x, ...)
}
\arguments{
\item{x}{Network input: matrix, igraph, network, cograph_network, or tna object}

\item{...}{Additional arguments passed to \code{\link{to_igraph}}}
}
\value{
Integer: length of shortest cycle, or Inf if no cycles exist
}
\description{
Computes the girth of a network - the length of the shortest cycle.
Returns Inf for acyclic graphs (trees, DAGs).
}
\examples{
# Triangle has girth 3
triangle <- matrix(c(0,1,1, 1,0,1, 1,1,0), 3, 3)
network_girth(triangle)  # 3

# Tree has no cycles (Inf)
tree <- matrix(c(0,1,0, 1,0,1, 0,1,0), 3, 3)
network_girth(tree)  # Inf
}
