测试蓝本，请留意，功能很全的，可以参照，减少工作量。

al arm参考文档，帮助快速查找资料，快速入门，对开发者都有很大帮助，希望大家都能喜欢，欢迎下载

computer phone

实现文件的FTP协议上传及下载，VC++实现，测试可以运行-The FTP protocol for file upload and download

下载论坛资源的 可以批量下载论坛上的rar资源-Download forums resources can bulk download rar forum resources

这是一个识别色环电阻的小程序，使用起来很方便。-This is a recognition of the color ring resistance small program was easy to use.

征管辅助，可以打印税收通用完税证等一些常用的税收票据，代码简单，其中包含了小写数字转换成金融大写数字的程序。-collection and management support, can print tax general tax certificate and some other popular tax bills, code simple. it covers a lowercase converted into financial capital figures procedures.

奇迹登录器E语言源码奇迹登录器E语言源码-Sign browser miracle miracle Login E language source language source browser E

数值积分的C程序-numerical integration of the C program

多功能信号波形生成与频谱分析仪，本人大学的毕业论文-Multi-function waveform signal generation and spectrum analyzer, My University thesis

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