搜索引擎PageRank算法实现及测试数据，测试输出，可执行文件。搜索引擎PageRank算法实现及测试数据，测试输出，可执行文件。

这是我自己的代码，主要用来存储，若能帮到其他人，我也很愿意。

可以实现icp(iterative closest point)的演算法，但需要安装open CV library.

Originally reactive protocols were not design for the characteristic of highly mobility during route discovery. Due to dynamically modification to the VANET this changes very often due to breakdown which causing excessive broadcasting and flooding the entire network in order for new routes to be discovered. In additional, the initial of routing need some time and this latency can easily change everything. Due to these reasons, the typical reactive protocols, in their current format, do not totally appropriate for time critical applications such as cooperative collision avoidance (CCA). The Cooperative Collision Avoidance is an important class of safety applications in VANETs, which aims at offering earlier warning to drivers using vehicle-to-vehicle (V2V) communication [13]. Ad Hoc On Demand Distance Vector (AODV) is an reactive routing protocolwhich capable of both unicast and multicast. In AODV, like all reactive protocols,topology information is only transmitted by nodes on-demand. When source hassomething to send then initially it propagates RREQ message which is forwarded byintermediate node until destination is reached. A route reply message is unicastedback to the source if the receiver is either the node using the requested address, or ithas a valid route to the requested address. This repository provides a MATLAB simulaiton of VANET enviornment and rsults comparison in terms of throughput, packet drop ratio etc. More information can be reached at https://www.youtube.com/watch?v=2QeSYOgJo9s&t=32s

在vs2008上用c++实现的knn分类器，内含测试数据，是初学者的好东西

apriori 算法c++程序实现，附测试数据以及使用说明，codeblocks下运行通过。 绝对简单明了。

原创实测有效的一个c++检测线程死锁的解决方法，已应用于项目，实测有效 原创文章地址：https://blog.csdn.net/liaozhilong88/article/details/80354414

c++实现的平衡树算法，带测试用例，测试中可以添加元素和删除元素，在添加和删除过程中树仍保持平衡

求平衡树的算法的c语言实现，带测试用例，适合算法学习用来做参考使用

kmeans聚类java实现附测试数据及结果