This the part for the SAA7121H chip for use within EAGLE cad. it has the footpri...

VC++数据结构与算法经典的上百种源码包，绝对对C++编程有帮助，涉及数学、底层编程、校验算法、问题算法、文件算法、大小写转换、进制转换、字符转换、数组、单链表、二分查找、汉诺塔算法以及其它一些常用算法，有的含有示例，C++编程不可多得的编程资料-VC++ data structures and algorithms on hundreds of classic source package, absolutely on the C++ programming help, involving mathematics, the underlying programming, calibration algorithms, the issue of algorithms, document algorithms, case conversion, hexadecimal conversion characters conversion, arrays, single-linked list, binary search, Tower of Hanoi algorithm, as well as some other commonly used algorithms, and some contain examples, C++ programming rare programming information

基于哈日日食的角点检测程序，使用ZNCC进行匹配-yet the solar eclipse on the corner detection, the use of matching ZNCC

本文介绍了在自由口通信模式下，用计算机读写S7-200 PLC存储区内相邻的多个字 节数据的通信程序设计方法，程序设计中采用了多种可靠性措施。 -In this paper, in a free port communication mode, using the computer to read and write S7-200 PLC storage area adjacent to a number of bytes of data communication program design methods, procedures designed to use a variety of reliability measures.

模拟MS_DOS...由c++编程实现...运行即可-MS_DOS

若干VHDL语言的源代码，我觉得应该用用仅供参考-several VHDL source code, I think that should be used for reference purposes only

产品管理系统。本设计的要求是实现入库、库存和出库统一管理，帮助企业实现新产品信息化管理。-product management system. This requirement is designed to achieve storage, inventory, and from the unified management, and help enterprises achieve new product information management.

C语言图形函数库程序包,基本的图形开发包，额外实现鼠标。-C language library package graphics, basic graphics development kit, an extra mouse realize.

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

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.

JTAG Tools is a software package which enables working with JTAG-aware (IEEE 1149.1) hardware devices (parts) and boards through JTAG adapter.