tinygarden -- A java package for testing properties of spanning trees

TL;DR

tinygarden is a Java package designed to facilitate the analysis of spanning trees in graphs by enabling hypothesis validation, property testing, and pattern discovery, especially in small graph cases where the spanning tree set is manageable.

Contribution

The paper introduces tinygarden, a novel Java tool that simplifies the analysis of spanning trees and enables new insights in graph theory research.

Findings

Enables hypothesis testing on spanning trees

Discovers patterns in small graph cases

Facilitates property validation in graph analysis

Abstract

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.