实现AllTopSorts算法，双链表做bag，succ数组是数组队列，pre是记录前指针个数的数组。时间复杂度为常数。-Achieve AllTopSorts algorithm, double-linked list do bag, succ array is an array queue, pre array pointer before the number of records. The time complexity is constant.