The girth of a graph is the length of its shortest cycle. In the case that the graph doesn't contain any cycles most people will define the girth to be , but we will leave it undefined.
In GrInvIn you can calculate the girth of a graph by using the girth invariant.