1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
|
% 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{distance_table()} to create a more
consistent API.
}
\keyword{internal}
|