sudoku很麻烦！不过自己试过也不错~

opc例子，详细构建了哦盘存server和opcclient。可以方便地进行工业控制通讯-opc example, constructed a detailed inventory server Oh and opcclient. Can be easily carried out in industrial control communications

mips核代码，Verilog写的，希望对大家有用-mips core code, Verilog written

news1.0.rar 一个JAVA的反便宜软件 图形界面 我就想下个插件 请管理员帮帮忙啊-news1.0.rar an anti-Java GUI software cheaper, I would like to request the next possession plugin Help staff in Manga

一些用到的函数 功能齐全，希望能对网友有所帮助-some use the Function complete, and hopes to help netizens

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

ＴＭＳＦ2812DSP281x_Mcbsp多通道缓存头文件-TMSF2812 DSP281x_Mcbsp multi-channel buffer header files

关于计算机图形学的图象处理哦！用于图形学课程设计所用！-on computer graphics image processing Oh! Curriculum design for the graphics used!

本程序模拟细胞的自我繁殖，这种自我复制是在人工化学的基础上进行，比起原来的基于细胞自动机的自我复制更加形象逼真。-the cell simulation of self-propagation, self-reproduction of the artificial chemical basis, compared to the original cell-based automatic machine self-replication more vivid.

测试信号源 labview程序-Labview signal source testing procedures. . . . . . . . . . . . . . .

gps pygarmin-0[1].6.tgz