几种排序算法的设计以及时间复杂度的比较.-Several sorting algorithms time complexity of the design and comparison of

标签传播算法，用于挖掘网络中的社团结构的算法。它最大的优点在于近线性的时间复杂度。-Label propagation algorithm is a algorithm for mining community structure of complex networks. Nearly linear time complexity is its greatest advantage.

TSP是典型的NP完全问题，即其最坏情况下的时间复杂度随着问题规模的增大按指数方式增长，遗传算法可进行有效求解(TSP is a typical NP-complete problem, that is, the time complexity in the worst case increases exponentially as the scale of the problem increases, and the genetic algorithm can be effectively s