1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/structural.properties.R
\name{farthest.nodes}
\alias{farthest.nodes}
\title{Diameter of a graph}
\usage{
farthest.nodes(graph, directed = TRUE, unconnected = TRUE, weights = NULL)
}
\arguments{
\item{graph}{The graph to analyze.}
\item{directed}{Logical, whether directed or undirected paths are to be
considered. This is ignored for undirected graphs.}
\item{unconnected}{Logical, what to do if the graph is unconnected. If
FALSE, the function will return a number that is one larger the largest
possible diameter, which is always the number of vertices. If TRUE, the
diameters of the connected components will be calculated and the largest one
will be returned.}
\item{weights}{Optional positive weight vector for calculating weighted
distances. If the graph has a \code{weight} edge attribute, then this is
used by default.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{farthest.nodes()} was renamed to \code{farthest_vertices()} to create a more
consistent API.
}
\keyword{internal}
|
