能够连接各种数据库的API

数据结构实验程序 线性表 栈和队列 二叉树 图 查找 内部排序-Experimental procedures for linear data structures stack and queue table tree diagram to find the internal order

深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick

求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.

MATLAB queen常见的来到过程有定长输入、泊松(Poisson)输入、埃尔朗(A. K. Erlang)输入等-MATLAB queen

一个小型的关系数据库系统，适合学习数据库的学生学习- A small relational database system, suits the study database the student studies

NOIP2004问题标程-NOIP2004 Standard-issue

floyd，求最短路径的算法。。求任意两点间的最短距离-floyd, seeking the shortest path algorithms. . Arbitrary order of the shortest distance between two points

项目的信箱基于 C + + 中处理该文件。 工作- 当我们打开我们的项目我们有四个选项 — — 1.报名 2.显示 3.签到 4.退出 1-通过报名我们可以通过输入用户名和密码创建我们的帐户的选项。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

一个商品销售系统-a sales system