Length of longest sequence avoiding an unavoidable set for different values of k.

For each value k, a minimum decycling set was removed from a complete de Bruijn graph, and the length Lmax of the longest sequence, represented as a longest path, was calculated.针对每个参数k的取值，从完全德布鲁因图（complete de Bruijn graph）中移除一个最小去环集（minimum decycling set），并计算以最长路径形式表征的最长序列的长度Lmax。