很好的算法，龙贝格积分算法，大家可以下载

仿windows优化大师界面（源码）123456-imitation windows optimization master interface (OSS) 123456

好用啊 ，主要是一些，小列子。你一定要看懂了再用！-handy ah, mainly some small Liezi. You must understand the reuse!

队列解决杨辉三角-Queue solve Pascal"s Triangle

用QUERY控件与 Table控件的database management.-with QUERY control and Table Controls database management.

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

图论与网络论中求最短路径的Dijkstra算法-Graph theory and network theory for the Dijkstra shortest path algorithm

数据结构停车场实习报告-data structure parking internship report

完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal

使用Windows Forms for GUI和DataSet进行数据访问的学生信息系统-VB.NET版-VS2010年

Bbd 示例软件访问-ADO 查询-在 DBGrid 显示按字母顺序排列的结果-添加、 删除和更改对编辑、 备忘录、 组合框和复选框，编辑搜索中按 Enter 键截潜-对话框，以确认删除，......