VC++语言实现与数据库的连接，效果不错的

本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。-This procedure for the data structure on the map part of the breadth-first search and depth-first search.

这是用QB编的排序程序。利用条形显示冒泡排序、快速排序、等五种排序方法。 效果一流，对于C语言，数据结构爱好者是不错的选择。-This is the sort made by QB procedures. Strip shows that the use of Bubble Sort, Quick Sort, five sorting method. The effect of first-class, for C language, data structure enthusiasts is a good choice.

图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法 -In graph theory a Kruskal algorithm for minimum spanning tree algorithm in graph theory a classical algorithm

二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。 - Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.

货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

本源码讲述如何把Excel文件转换成mdb数据库。-The source on how to convert Excel files mdb database.

VB+access+ado

这个程序时还没有powerdesigner,erwin的时候出现的，到现在也实用，需要fmt的一个格式文件来描述表结构，执行完毕形成xxx.sql语句，然后isql -Usa -P -Sservname -ixxx.sql即可-this procedure was no powerdesigner, erwin the time and it has practical need fmt format of a table to describe the structure, finished form xxx.sql statement, and then isql-Usa- P-Sservname-can ixxx.sql

建设银行帐户管理系统 visual foxpro代码 -bank account management system visual code foxpro

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output