无控件版Delphi图书管理系统源码Access数据库

对学习C++编程很有启发的一个例子，包括了C++的各核心的应用，是学习C++不错的选择-Learning C++ Programming a very instructive examples, including the C++ The core applications, is to learn from C++ Good choice

实现了C++语言链表的功能，实现了函数（size，length，search，locate，getdata，setdata，insert，remove，isempty，isfull，output，input)-Achieved a C++ language features list to achieve the function (size, length, search, locate, getdata, setdata, insert, remove, isempty, isfull, output, input)

这是一个基于MapInfo的GIS软件,将地图上的图元分开或合并 ，并包括一般地图查看功能 -This is a GIS-based MapInfo software to map the map yuan separately or in combination, including general and functional map View

linux-2.6内核下的usb驱程移植说明文档-linux- 2.6 kernel under the usb drive-transplant documentation

1、 具有以数字形式显示时、分、秒的功能。 2、 小时计时要求为“１２翻１”，分和秒计时要求为６０进位。 3、 校正时间的功能。 4、 定时功能。 5、 报整点时间的功能。-one is in digital form, the minute and second functions. 2, the time required for hours, "turned a 12", will require time and the second for 60 to rounding. 3, time correction function. 4, the timer function. 5, at the time the whole function.

void mainmenu()                  /*主菜单*/ void Integermenu                 /*整数运算的菜单*/ void realnumbermenu()           /* 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

纠删码 冗余编码，可以提高数据的可靠性 可以与云备份结合应用-Erasure 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

操作系统实验，进程同步与互斥读者写者问题，用vc实现-experimental operating system, and coordinate the process of the readers who wrote, using vc achieve

牛顿－拉夫逊法潮流计算 基本步骤： 　　（1）形成节点导纳矩阵 　　（2）将各节点电压设初值U， 　　（3）将节点初值代入相关求式，求出修正方程式的常数项向量 　　（4）将节点电压初值代入求式，求出雅可比矩阵元素 　　（5）求解修正方程，求修正向量 　　（6）求取节点电压的新值 　　（7）检查是否收敛，如不收敛，则以各节点电压的新值作为初值自第3步重新开始进行狭义次迭代，否则转入下一步 　　（8）计算支路功率分布，PV节点无功功率和平衡节点柱入功率。-Newton-Raphson method flow calculation basic steps : (1) formation of nodal admittance matrix (2) to set up the initial node voltage U, (3) the initial node-generation-related demand. calculated that the constant term formula Vector (4) nodes will be incorporated into the initial voltage-seeking, calculated Jacobian matrix elements (5) solving that equation, seek to amend the vector (6) to strike a new node voltage value (7) to check whether convergence, if not restrained. concentrated in the nodes of the new voltage as the initial value since the first three steps to re-start the narrow iterations. Otherwise, turn into the next (8) Calculation branch power distribution, PV nodes reactive power and balance-node into powe