Bintree graphs bintree generates graphs based on binary trees and rotations. The vertices of a graph represent binary trees each of which has n internal nodes and is at most mxh high. With -mxh0, no restriction on the height is imposed. Cycle graphs cycles constructs cycles. The vertices of a graph are labelled with nonnegative integers.
Miles graphs miles generates graphs based on highway mileage data between North American cities.
Each vertex represents a city. Two vertices are adjacent if the distance between the corresponding cities does not exceed the maximal acceptable distance d . There is a maximum of 128 cities that can be represented. Each vertex of the graph correspondes to one football team. Value between 0 and 128 -l last day.