themselves prepared a 331 vc hope that the right

运用matlab，根据历史数据进行的多项式拟合，可对今后的数据进行预测-use Matlab, according to historical data for the polynomial fitting, for the future of data forecast

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

阻抗计算工具,很有用。 阻抗计算工具,很有用。-Impedance calculation tool, very useful. Impedance calculation tool, very useful. Impedance calculation tool, very useful.

线索二叉搜索树结点的插入删除以及树的打印。-clues two forks search tree node of the tree to insert, delete and print.

学生成绩管理系统，C++做的，可作参考！-Student achievement management system, can be used for reference!

哲学家编程的算法-philosopher programming algorithm

汉语拼音输入程序，可以智能对字排序，并可输入词组。你可以自己改进！-Pinyin input program can be intelligent sort of word and phrase input. You can improve!

dos下另一虚拟光驱-dos under another virtual drive

Fingerpass 指纹识别算法的研究与应用-Fingerpass fingerprint recognition algorithm research and application

几种常见的伪随机数的产生程序，上载程序是从别处下载的，觉得还比较有用-several common pseudo-random number generated procedures, procedures are available on the download elsewhere, I felt that more useful