功能：四阶幻方全解 运算时间：3、40秒 结果：7040个 环境：Visual Studio.net 2003的vc++的控制台项目...

Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!

数据结构的课程设计，编程实现一个简单的分配问题！-Curriculum design, data structures, programming a simple allocation problem!

对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.-DataStatistics

十字链表，可实现插入，删除，保存，恢复等功能-Cross linked lists, can be insert, delete, save and restore functions

这是一个关于最长单调递增子序列的代码能运行-This is a monotonically increasing for the longest sequences of code to run

快速排序算法代码Quick sort algorithm code-Quick sort algorithm code

&公共静态字节[]加密（SqlString s）

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

二叉树的基本操作-binary tree as the basic operation

推箱子状态空间搜索,慢慢研究吧。分支限界法，采用优先队列实现-tuixiangzi