NS2实现Zigbee Tcl代码。

系统采用Microsoft公司C#.NET(GDI+)技术开发,转载-system using Microsoft C#.NET (GDI) technology development, reprinted

使用VB，在MAPX中开发的合并图元的代码-The use of VB, in the merger MAPX developed Metafile code

[输入] 图的顶点个数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++编写的模拟彩票的程序，有三种不同的彩票类型，正在学习C++的同学可以下载参考一下。-The use of C++ Prepared lottery simulation procedures, the Lottery has three different types, are learning to C++ Students can download the reference.

很好的C++课件，适合初学者。ppt格式，希望对大家有帮助！-A very good C++ courseware is suitable for beginners. ppt format, you want to help!

一款入门级别的益智类游戏源码。 ＝^_^＝-entry-level educational games source. =^_^=

汇编原码“霓虹灯”的模拟显示.rar-compilation of the original code, "neon" simulation show. Rar

linux 下usb to com 的驱动-under linux usb drivers to com

炸弹人---Windows下经典小游戏,很怀旧的哦,其人工智能部分很有意思.-bomb people-- Windows Small classic games, is nostalgia Oh, its very interesting part of artificial intelligence.

Program for 3 phaze power meeter