对象

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

这书数据报告系统写用 visual basic 6.0 和 access 数据库允许我们由承租人向出租人书记录并显示整个报表。

VC++访问DAO数据库-VC visit DAO Database

mapreduce的工具软件。来源为ibm 的技术论坛。-mapreduce software tools. Source for ibm technical forum.

ORACLE数据库得建表语句-ORACLE database built in Table statement

100个vfp 小程序源码，对于初学者来说很有用-100 -100 VFP applet source code, useful for beginners-100

VFP图书馆管理系统-VFP Library Management System

矩阵求逆的c++程序,用来算大规模带分数形式的逆矩阵的,文件输入-matrix inversion c procedures for the large-scale Daibanshu form of the inverse matrix, the file input

思想很简单，就是一个循环链表 但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.