Logical, whether directed or undirected paths are to
be considered. This is ignored for undirected graphs.
unconnected
Logical, what to do if the graph is unconnected. If
FALSE, the function will return the largest possible diameter which
is the number of vertices. If TRUE, the diameters of the connected
components will be calculated and the largest one will b
Value
A numeric constant for diameter, a numeric vector for
get.diameter and a numeric vector of length two for
farthest.nodes.
Details
The diameter is calculated by using a breadth-first search like
method.
get.diameter returns a path with the actual diameter. If there
are many shortest paths of the length of the diameter, then it returns
the first one found.
farthest.points returns two vertex ids, the vertices which are
connected by the diameter path.