  Spanning trees are fundamental objects in graph theory. The spanning tree set
size of an arbitrary graph can be very large. This limitation discourages its
analysis. However interesting patterns can emerge in small cases. In this
article we introduce \emph{tinygarden}, a java package for validating
hypothesis, testing properties and discovering patterns from the spanning tree
set of an arbitrary graph.
