ieee802.11关于ad hoc网路协议的介绍，希望对各位学习有所帮助。...

c#源码,吃豆子游戏。由visual studio2003开发的应用程序-c# source, eating beans games. Studio2003 by visual application development

全是用if then　走的坦克游戏．画面精彩．背景可移动-are used if the tank then take the game. Brilliant screen. Background Mobile

Memory card Driver For HCL laptops

[输入] 图的顶点个数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 the Guide database, a very professional script is a tutorial database is a key university in a very professional script,

用avr控制nrf905的接收程序，自动接收单片机的发送数据。-yong avr kong zhi nrf905 de jie shou cheng xu

简单的二分查找算法，用java语言实现，-A simple binary search algorithm

sudoku很麻烦！不过自己试过也不错~-sudoku lot of trouble! But they tried too ~!

点名程序，实现了头像的变换，储存，单个按钮，声音-adsc

是一个数码编辑