可以将列表控件中的内容导出到EXCEL中，是一个比较重要的功能。...

通过keilc51程序，学习者可以了解车辆控制器局域网（controllerareanetwork，can）信息的传输。

jad，一个反编译工具，可以作为eclipse的插件-jad, an anti-compiler tools, can be used as eclipse plug-ins

QUARTUS-7.2的破解软件，可以破解QUARTUS-7.2，能用到2034年。-The crack QUARTUS-7.2 software, can crack QUARTUS-7.2, can be used to in 2034.

菜单的显示程序，用结构体编写的，希望对大家有用-hhhhhhhhhrrrrrrrrrrrrrrrrrr

工会会员信息管理系统 v1.0.5 (DAO+ACCESS+QR).-union members Information Management System v1.0.5 (DAO ACCESS QR).

与成熟的传统门户不同，博客门户是基于很多新兴以及还将不断涌现的新技术，因此它的实现和表达方式仍在摸索。-And maturity of the traditional gateway to different blog portal is based on the many emerging and will continue to emerge of new technologies, so its realization and expression are still exploring.

gongju其他人可以解析FLASH程序代码-gongju other people analytic procedure code FLASH

PROVIDES TO USE REPULSIVE PARTICLE SWARM METHOD TO COMPUTE COMPOSITE INDEX

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

Write Fruid in DOS system