DST工况设置

Ｌａｂｖｉｅｗ编写的ＥＰＰ控制程序源码。ｌａｂｖｉｅｗ７．０-Labview control procedures for the preparation of the EPP-source. labview7.0

LINDO用于求解线性规划和二次规划问题，LINGO除了具有LINDO的全部功能外，还可以用于求解非线性规划问题，也可以用于一些线性和非线性方程(组)的求解，等等。-LINDO for solving linear programming and quadratic programming problems, LINDO LINGO addition to the full functionality, but also can be used for nonlinear programming problem some also can be used for linear and nonlinear equations (Group I) solution, and so on.

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

The character has since appeared in every subsequent volume of the series.

数据保存到EXCEL文件 给出了实例文件可以参考(EXCEL data files saved to the file is given instance can refer to)

ads1115历程以及最小系统 基于msp430(Course and schematic diagram of ads 1115 Based on MSP430)

本系统根据养老院床位的预约，登记，入住，吃，用药，请假，销假等工作中的流程设计完成，针对老人在养老院的费用账目清晰按月结账。并且针对老人的特殊要求，有关键的注意事项等。(The system is designed according to the process of the appointment, registration, check-in, eating, medication, leave and holiday selling of the beds in the nursing home. The expense accounts of the elderly in the nursing home are cleared monthly. And for the special needs of the elderly, there are key points for attention.)

C++开发的。农夫过河。一个农夫带着一只狼，一只羊和一些菜过河。河边只有一条一船，由 于船太小，只能装下农夫和他的一样东西。在无人看管的情况下，狼要吃羊，羊要吃菜，请问农夫如何才能使三样东西平安过河。 -C development. Farmers across the river. A farmer with a wolf, a goat and some vegetables across the river. Only a river boat, the boat is too small to install under the farmer and his thing. Unattended circumstances, the wolf to Qiyang, the sheep to the meal, ask the farmers how to make three things safely across the river.

fontrouter code, a small hacky program to change the font in nokia symbian devices

这是一个高斯消元发解方程的c语言实现。对于接多元方程非常的方便-This is a Gaussian elimination of the solution equation c language. For multiple access very convenient equation