The diameter of a graph is the maximum distance between two vertices in the graph e.g. a path graph has a diameter that is equal to its size and a complete graph has a diameter that is equal to 1.
In GrInvIn you can calculate the diameter of a graph by using the diameter invariant.