这是一个用Turboc2.0写的程序，实现了组合数学的字典序法。
0 used to write procedures to achieve a combination of mathematics lexicographic law.
比较操作按字典序进行：首先比较前两个元素，如果不同，就决定了比较的结果；
The comparison uses lexicographical ordering: first the first two items are compared, and if they differ this determines the outcome of the comparison;
刻划了具有P -正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P -正则性。
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed.
分析：题意是给你一个单词字典，每次询问一串字符，问能否组成字典里的单词，并按字典序输出。
For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word.
该算法采用了字典序组合法对A级方案进行遍历，设计了一种遍历方法对B级方案进行遍历，有效地解决了方案遍历问题。
This algorithm uses the dictionary sequence to enumerate the A level scheme, and designs one method to enumerate B level scheme, which effectively solves the problem.
该算法采用了字典序组合法对A级方案进行遍历，设计了一种遍历方法对B级方案进行遍历，有效地解决了方案遍历问题。
This algorithm uses the dictionary sequence to enumerate the A level scheme, and designs one method to enumerate B level scheme, which effectively solves the problem.
应用推荐