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.
Details
The diameter is calculated by using a breadth-first search like
method.