prototype.js原代码包及详细原代码讲解,迅速让你通过高质量的原代码掌握函数式编程,是js水平提升一个新高度...

利用ns2进行的圆形设置的无线网络仿真，使用DSR协议。-A simulation of circled wireless network under DSR protocol in NS-2.

mc39i硬件手册,您上载的源码为何会被站长不采用或帐号被删除.-mc39i hardware manual, you upload the source code for that station will be not be adopted or account be deleted.

java写的弹球游戏-the pinball game

oracle数据库的好文章,介绍ORACLE内存的处理和调优-oracle database on a good article, ORACLE introduce and deal with memory tuning

基于VFP开发的一个经典企业考勤管理系统，虽说界面不太好看，但功能齐全强大-VFP on the development of a classic enterprise management system for attendance, although not very good-looking interface, but powerful full-featured

非常好的汉字转换为GB和Unicode工具-very good conversion of Chinese characters and Unicode tools GB

这是用MATLAB编写的静态图片压缩程序中的基于灰度解压部分-is prepared using MATLAB static picture compression process of extracting some of Gray

办公室系列用品 办公室系列用品 -office supplies Series Series Office Supplies Office Supplies Office Series Series Series supplies office supplies office supplies Series

example for lcd1602 with 8051 ide program use 8051 with c 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