八数码问题的C++实现，最经典的广度有限算法

我自己写的数值分析课程设计的源代码，这里是数值插值算法的内容。-I wrote it myself numerical analysis courses designed source code, here is the interpolation algorithm for the numerical content.

kruskal算法，数据结构中贪心算法的C语言实现。-Kruskal algorithm, data structure of the greedy algorithm in C language.

TRegExpr is easy to use and powerfull tool for sophisticated search and substitutioning and for template-based text checking (especially usefull for user input validation in DBMS and web projects).

VB的图书馆系统，数据库使用ACCE-VB of the library system, the use of ACCESS database

直接下载，用vc++6.0打开 可直接运行，数据库为access2003，语言为vc++，适合初学者 直接下载，用vc++6.0打开 可直接运行，数据库为access2003，语言为vc++，适合初学者

jdbc连接db2范例,非常完整,我找了很久,供学习参考-jdbc connecting db2 example, the very integrity, I look for a long time for study reference

java 排序，冒泡排序，快速排序，选择排序，插入排序，堆排序，归并排序等等！-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

实验室设备管理系统 vb 需要的可以参考下-shiyanshi shebei guanli xitong

数据结构的演示，其中包括了大多数常用数据结构的算法图示和程序