% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/paths.R
\name{path.length.hist}
\alias{path.length.hist}
\title{Shortest (directed or undirected) paths between vertices}
\usage{
path.length.hist(graph, directed = TRUE)
}
\arguments{
\item{graph}{The graph to work on.}

\item{directed}{Whether to consider directed paths in directed graphs,
this argument is ignored for undirected graphs.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{path.length.hist()} was renamed to \code{\link[=distance_table]{distance_table()}} to create a more
consistent API.
}
\section{Related documentation in the C library}{
\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist()}}
}

\keyword{internal}
