此程序是利用图形函数画Lagranges函数，分段插值函数，Hermite函数的函数图形...

枚举DNS数据源.可以用来获得计算机中所有的DNS数据源.本例主要利用CDSNCollection类.-DNS enumeration data sources. Computers can be used to access all of the DNS data sources. The cases mainly use C DSNCollection category.

VC做的社区住房管理系统！-VC community housing management system.

AirtoFly.com中的长途有关信息抓取,并存写在数据库中-AirtoFly.com relevant information in long-distance crawling, both written in the database

ADO直接读取数据库的编程实例-read directly ADO database programming examples

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

ＰＯＪ　１００１己ＡＣ源代码，不信你可以试试．-POJ 1001 F AC source code, do not believe you can try.

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

创建BDE别名，在运行时自动创建的。-BDE created Alias, operates automatically created.

Interactive SQL Tool