A personnel system, code and databases.

鳄鱼论坛，自己在网上找的，测试了，数据库是mysql的，方便用户使用，有需要的下载吧-Crocodile Forum, the Internet looking for their own testing, and database is mysql, user-friendly to use, there is a need to download bar. .

基于fpga串口通信,有数码管显示发送和接受现实-du to fpga

摩托罗拉w156驱动，由其它版本驱动修改来，moto暂时还没有官方的w156驱动，用这个先对付一下吧。-Motorola w156-driven, driven by modifications to other versions, moto far there have been no official w156 driver, use this to deal with you.

excel VBA制作的小游戏,吃豆子,为学习EXCEL VBA的朋友上传

It is an HTML file which will guide you how to kill yourself!

简单的helloworld程序，使用c编写。保证是所有程序员都倍感亲切的程序。-A simple helloworld program using c write.

Java 教程与实例，英文版。目录Table of Contents   Context   Computers and Software systems ComputersSystem Software System Systems programs and systems programmers – a possible source of confusionComputer programming language

[输入] 图的顶点个数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语言写的 期末课程设计-A student grade management

saa7121寄存器的配置值，已经测试过-saa7121 configuration register value, have been tested