FLASH游戏<接元宝>.现在上传给大家,一起交流学习.

地 税 发 票 系 统5.1( delphi 版 本)-地税发票系统

几个C++库函数,也是经常用来测试编程实力的函数!-several C library functions, but also often used to test the strength of programming function!

游戏一个小游戏你可以自己在其中玩！很好玩的一款游戏啊-game a little game you can play in them! Very fun in a game ah

PIC12F675 定时器程序 加protues 仿真 -PIC12F675 Timer Simulation of the processes in protues

UML基础案例与应用。对你学习UML专业理论知识来说无疑是个好帮手，赶快动手吧！-UML case basis and applications. You learn UML professional theoretical knowledge is undoubtedly a good helper, hurry hands!

这是自己做的一个FLASH文件，主要显示的是AA大学的图片及其历史-This is their own to do a FLASH file, mainly shown in the picture is AA University and its history

这个做的是模拟银行的ATM截面，很简单的一个小程序，大家参考以下把-do is the bank"s ATM simulation section, a very simple one small procedure, we put reference to the following

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

JSWDK服务器-root servers

at45db081测试程序，实现单片机与该芯片的数据流通信情况；-at45db081 testing procedures, to achieve single-chip with the chip data flow communication situation