MatlabreadGPSRinex

hello progrma for qtopia

说明：  求二维数组每列中的最小元素，并依次放入PP所指的数组中(Seeking two-dimensional array of elements)

describe the general understanding of 4-dimensional object.

Programming embebbed software from Oreylly

不是代码，仅有的一点编程资料，希望可以与大家分享，很好很实用的资料(Not a code, the little programming information, hoping to share with you, very good very practical information)

CST微波工作室用户全书,学习cst软件必备书籍。微波工作室！(CST Microwave Studio User book)

华为公司最新的员工内部培训资料，设计编程规范，常见低级错误案例、优秀代码样例(Huawei in-house employee training materials, design programming specifications, common low-level error cases, excellent code sample)

说明：  1、 创建图类，存储结构使用邻接矩阵。 2、 输入图的节点数n（不超过10个）、边数m，节点分别用1-n代表。 3、 采用“起始节点，终止节点，权值”输入图的m条边，创建图。 4、 输出从节点1开始的BFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。 5、 输出从节点1开始的DFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。 6、 输出从第1节点到第n节点最短路径的长度，如果没有路经，输出0。(1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)

说明：  软件工程中结构化分析方法资料，适合初学者(Structure analysis method in software learning)

Software Testing(SWEBOK Guide)