my personal site please look at the many

C++练习小代码，适合新手。 集合了10个新手练习C++的代码，比较简单，主要是给刚开始学习C++的童鞋一些入门小代码，如果是老手就不用下载了。

能帮助宾馆和学校学生宿舍管理员能进行来客的登记管理。-Hotels and schools can help students in dormitories administrator can carry out visitor registration management.

详细讲解了Mean-shift的核心思想.可用于图像分割,运动目标检测

VC+++课程设计程序加论文++源代码有注释-VC+++ processes in curriculum design papers++ source code annotated

matlab小波去噪

一种窄带干扰抑制的非线性自适应预测滤波算法！-a narrowband interference suppression filter nonlinear adaptive prediction algorithm!

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

一个雷达的模拟程序-a radar simulation program

实现8张图片的拼接，锻炼思维，从而助拓展思维-8 picture realize splicing, exercise ideas, and thus help expand thinking

商业版可以向你的网站发送假的请求，大幅度的增加你的网站的点击率和排名 name:www.mycodes.net sn:042392934239-Commercial version could be sent to your Web site leave request, a substantial increase in your site s click-through rate and ranking name: www.mycodes.netsn:042392934239