复杂网络社团结构划分算法里最经典的ＧＮ算法和ＦＮ算法的实现原码-Community structure of complex networks division algorithm in the most classic GN algorithm and the algorithm to achieve the original code FN

Minhashing和LSH算法。用于查找和比较一个pair是否是相似的。并分析false negative和false positive的值-Minhashing and Locality-Sensitive-Hashing (LSH). The algorithms are approximate in that they find only candidate pairs that are likely similar. Therefore, there are two types of

通过fn算法，实现社区网络发现的一个例子。(Through FN algorithm, an example of community network discovery is implemented.)

RT（快速扩展随机树）是一种基于采样的算法求解路径规划问题。RRT提供可行的解如果时间RRT趋于无穷大。 RRT *是一个基于采样的算法为解决运动规划问题，这是一个概率最优变异性。RRT *收敛到最优解的渐近。 RRT * FN是一个基于采样的算法基于RRT *。RRT * FN内在渐近收敛到最优解，然而RRT * FN实现使用更少的内存(RRT (Rapidly-Exploring Random Tree) is a sampling-based algorithm for solving