fffff gggggg ggggggg g

换乘次数最少是乘客出行时考虑的首要因素。描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段 距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Description of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path

arc开发文件，详细介绍了arc的开发步骤和事例的说明，可读性强。-arc to develop a document detailing the development of arc steps and examples show that strong readability.

用Visual C++开发数据库应用程序包括源程序和注释-Visual C development database applications, including source and Notes

模式识别中的（近邻）算法的实现，很有帮助的-Pattern Recognition (K neighbors) algorithm, useful

超经典的51试验程序，绝对是初学单片的好资料。-Ultra-classic 51 testing procedures, is definitely a good beginner-chip data.

.3gp 文件格式-.3 gp file format

中国繁难文字字库初编-China troublesome text font early series

一些RFID的文章，分为5个文件这是前4个，希望对这一领域的研究有帮助

Computer Algeral For Fingerprint Matching

一个FlexGrid应用的好程序-a good FlexGrid application procedures