FORALL-PMVC benchmarks

该数据集包含了完全二分图K_{n-2,n}的基准测试，其中n的取值范围是从10到70（包括10和70）。这些基准图都没有完美匹配。此外，该数据集还包括了Tutte编码的基准测试，以及与其他算法如Blossom算法和Exact-One编码的比较。所生成的图规模根据n值的不同，范围从10到70。该数据集的任务是评估Tutte编码在识别不存在完美匹配方面的效率。

This dataset contains benchmark tests for the complete bipartite graph K_{n-2,n}, where n ranges from 10 to 70 (inclusive). All these benchmark graphs have no perfect matchings. In addition, this dataset also includes benchmark tests for Tutte encoding, as well as comparisons with other algorithms such as the Blossom algorithm and Exact-One encoding. The size of the generated graphs varies with n, ranging from 10 to 70. The task of this dataset is to evaluate the efficiency of Tutte encoding in identifying the absence of perfect matchings.