read your package and describe it at least 40 bytes in English.

j2me手机游戏代码,内含图片素材和源代码文件-j2me mobile game code, including picture material and source code files

数据装载监控程序-data loading control procedures

将某个目录下的子目录结构转换为excle文件中，并可打印出来-Will be a directory under the subdirectory structure is converted to excle documents, and print out

1.本程序获取一些点坐标作为输入。 输入的文件的格式： 第 1 行： 点数目 其他线路： x y 2.然后它计算凸格雷厄姆扫描算法。 3。 最后它计算的质心凸包使用下面的公式：

Ole编程，读取Word中表格的文本内容 对于加了宏的Cell内容，暂时没有想到怎么获取。请高手指导 -Ole programming, read the Word in the form of text content for the addition of macro Cell content, there is no thought of how to obtain. Please expert guidance

busbox 1.0-busbox 1.0, the first full edition of busybox.

一个简单计算器源代码，包括class文件-A simple calculator source code, including class file

[输入] 图的顶点个数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

五个C++程序源代码-5 C source code

VB小程序,刚做的,刚学,不会做什么,请多指教,thank you very much-VB small procedures, just do, just learning, not to do anything, please enlighten. thank you very much