|
GraphTheory[Girth]
|
|
Calling Sequence
|
|
Girth(G)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
|
|
|
|
Description
|
|
|
•
|
Girth returns the length of the shortest cycle in a simple graph.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?
