# diameter

From igraph v0.4.4
by Gabor Csardi

##### Diameter of a graph

The diameter of a graph is the length of the longest geodesic.

- Keywords
- graphs

##### Usage

```
diameter(graph, directed = TRUE, unconnected = TRUE)
get.diameter (graph, directed = TRUE, unconnected = TRUE)
farthest.nodes (graph, directed = TRUE, unconnected = TRUE)
```

##### Arguments

- graph
- The graph to analyize.
- directed
- 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

##### 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.

##### Value

- A numeric constant for
`diameter`

, a numeric vector for`get.diameter`

and a numeric vector of length two for`farthest.nodes`

.

##### See Also

##### Examples

```
g <- graph.ring(10)
g2 <- delete.edges(g, c(0,1,0,9))
diameter(g2, unconnected=TRUE)
diameter(g2, unconnected=FALSE)
```

*Documentation reproduced from package igraph, version 0.4.4, License: GPL version 2 or later (June, 1991)*

### Community examples

Looks like there are no examples yet.