Graduation Collection

一个COMBOBOX的扩展类-a COMBOBOX the extension of the class

ST芯片开发资料以及说明--MP764W-ST chip as well as on the development of information MP764W

网络设计师考试资料。个人觉得不错的。希望对一些想考试的人有帮助-network designers examination information. Feel good. Some hope to those who want to test help

authorware制作的隐藏菜单。是authorwarer的源程序。可用来做示范。-produced by the hidden menu. Yes authorwarer of the source. The model can be used to do.

易语言开发的屏幕键盘.功能很强大，特别实用于编写对安全要求很高的软件。-Easy screen keyboard language development. Features a very powerful, especially useful in the preparation of the safety requirements of high software.

xml transform xlt tools-xml transform xlt tools

simple clock on PIC16f886 writing at mikroC 8.2 proteus 7

PHP 建站工具,CMS系统,类似与oscommerce-PHP建站tools, CMS systems, similar to osCommerce

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

这是一个关于时间的小程序，对初学者有很大的参考价值-This is a time for the small program for beginners have great reference value