拼写检查器

串口调试相关源码-relevant source

古典Jacobi的算法。-classical algorithm.

HDB3编码器的设计 HDB3编码器的设计 -HDB3 Encoder HDB3 Encoder HDB3 Encoder HDB3 Encoder

基于MATLAB的2PSK调制,调制解调部分源文件-based on MATLAB 2PSK modulation, modulation and demodulation part of the source document

成绩单管理系统，非常好-report card management system is very good

用于解决2004年电力系统问题的matlab程序-Used to solve the problem of power system in 2004 program matlab

脱机手写汉字识别-Chinese Character Recognition

二重积分 Guass―L高精度求积计算，精度高，速度快-double integral Guass-L for the calculation of high-precision, high accuracy and speed

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

这个程序有Alpha的代码,不过太慢了,我一直无法使他支持MMX,唉!我的p54c(你不知道p54c p55c的区别?)...如果您改进了他或完善了,请给我一份好吗?让我们共同进步!-Alpha code, but too slowly, I have been unable to keep him support MMX, huh! I p54c (you do not know the difference between p54c p55c) ... If you improve his or refined, please give me a copy please let us make progress together!