report!

计算机算法设计，用于设计动态规划，你们懂得-Computer algorithms designed for the design of dynamic programming, you know

本源代码是通过堆栈的结构，可以实现表达式求值。可以实现如下功能：1.区分括号2.判断表达式的形式是否有错3.判断小数和整数4.根据符号的优先级能够自动给出计算顺序。5.包中含有表达式求值的详细思路PPT。

数据结构课程设计，用C语言编写的约瑟夫环-data structure course design, preparation of the C language Josephus

十字链表，区分表头节点和普通节点，普通节点有上下左右四个指针域。-Cross, the head of a distinction between ordinary nodes and nodes, namely ordinary nodes around four target domain.

Delphi 写的 DataSet 导出为Excel 类，不用第三方控件，从CReoprt中切出来，又加工的。

非常完美地二叉搜索树模板～～～～ 希望大家能够喜欢，并且提出宝贵意见和建议-perfectly Binary Search Tree template ~ ~ ~ ~ hope that we can love and made valuable suggestions and recommendations

用vb6.0实现GIS的重要算法TIN的生长算法。-GIS using vb6.0 an important method to achieve the growth of TIN algorithms.

*Cube:最大子长方体问题 问题描述: 一个长，宽，高分别为m,n,p的长方体被分割成个m*n*p个小立方体。每个小立方体内有一个整数。 求所给长方体的最大子长方体。子长方体的大小由它所含所有整数之和确定。 */-* Cube : The biggest problem for rectangular Problem description : a long, wide and high respectively m, n, p rectangular cut into the 000 m* n* p small cube. Within each small cube is an integer. Seeking to have the largest rectangular son cuboid. The son of rectangular size it contained all integral and defined.* /

有向图 编写程序判断该图是否含有环 如没有则输出其拓扑序列-Digraph write a program to determine whether it contains any part of the plan if there is no sequence of the output of its topological

用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.