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.

翻译：生成树是图论中的基本对象。任意图的生成树集合规模可能非常庞大，这一限制阻碍了对其进行分析。然而，在小型案例中可能显现出有趣的模式。本文介绍了\emph{tinygarden}，一个用于验证假设、测试性质并从任意图的生成树集合中发现模式的Java包。