pdh控制程序，用于控制通信类光电端机应用程序

通讯录系统源码，本系统原码是针对新手学习用的，如果你熟练VC++，请不要下载！-Source address book system, the system is the original code used for novices to learn, if you are skilled VC++, Please do not download!

关于c++中继承和多态非常好的讲解实例.能够非常快速地学习理解继承。-a program of c++.the best instance of study c++.

虽然是一个小小的例子,却是基本上包括了C++多态的含义!是很好的学习材料-Although it is a small example, but it is basically a C polymorphism meaning! It is a good learning materials

这是430中7289的源代码，可以做头文件哦-This is the 7289 430-source code that can be done first document oh

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

关于遗传算法优化BP网络的 ,感觉没什么用-on genetic algorithm optimization BP Network, feeling useless

对话框子类设计，窗口拆分的源程序，是进行界面开发的好资源。 -Subclass dialog design, split the source window, interface development is a good resource.

包括各种各样的系统功能，特别棒-include a wide range of system functions, in particular wand!

Broadband Series - ATM Basics -Broadband Series- ATM Basics

altera byteblasterII sch