一个可以生成标准翼型坐标，并对翼型在不同攻角下进行升力系数及阻力系数计算的软件。...

2 Freeware MFC classes to encapsulate shell shortcuts

四种UNIX消息队列操作函数-four UNIX operating function Message Queue

ER diagram help in Microsoft visio

金融中优化模型的讲义，对数学建模很有用，希望大家多多下载-Optimization model finance lectures on mathematical modeling is useful, I hope everyone a lot of downloads

[输入] 图的顶点个数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语言版）清华大学出版社第一章课件-Data structure (C language version), Tsinghua University Press, chap Courseware

在DOS环境下支持长文件名的使用-in DOS environment to support long file name to use

介绍了微波patch天线的基本原理和特性，具体用了gps天线作为例子进行设计推导。-introduced a microwave antenna patch the basic principles and characteristics with a specific example gps antenna design is derived.

该汉字库软件用于生成16X16汉字点阵数据-16X16 hanziku

windows api 在pb中的定义说明,希望对pb编程爱好者有所帮助-windows api pb in the definition shows, and I hope to pb programming enthusiasts help