6个经典数据结构JAVA解法，供学习。

一个超完整的医药管理系统,使用ACCESS数据库，里面有很多小技巧，如CEdit和CListCtrl的技巧-A super-complete management system of Chinese medicine, the use of ACCESS database, there are many tips, such as skills CEdit and CListCtrl

数据结构课程设计，这是我们的最后要上交的课程设计，做的较认真，代码有详细中文解释-Data structure the curriculum design, and this is our last to hand over the curriculum design, to do more serious, detailed English explanation of the code

数据结构的源程序约瑟夫环和最短路径-data structure of the source Josephus and the shortest path

wce4.0,database,- wce4.0,database

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

把中缀表达式转换成后缀表达式，输入中缀表达式输出后缀表达式-Chinese sergeant expressions into expressions suffix, the importation of Chinese exports suffix sergeant expression expression

严蔚敏编写的《数据结构》第10章的答案，全部为源码-the answers of chapter 10 of a book called ‘Data Structures’ writen by Yan Wei Min

shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedures at the beginning of each user input first-sequence binary tree nodes value, for the importation of empty node by right-ENDTAG value (tentatively scheduled for integer 0). After a good binary tree can be automatically traversal sequence followed output of the node values.---- Author : zhg 2006.11.26 E-mail : wudazhg@163.com for reference purposes only learning, retention of title

三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)

数据预测算法，主要是一元n次方程的回归预测实现。* 预测分析--本算法只适用于有明显线性趋势的数据 * 默认为一元二次曲线方程法 * * 本程序主要涉及有两个算法 * 1．用最小二乘原理找到线性方程组的系数和常数。 * 2．解线性方程组 * 本程序在解线性方程组中，由于考虑到收敛性问题未采用迭代法，而是采用Gauss-Jordan消去法来解决。-data prediction algorithm is mainly one yuan n equation forecast to achieve reunification.* Forecast and Analysis-- This algorithm applies only to clear linear trend data* default as a quadratic curve equation method** The procedure involves two main algorithm* 1. Using the principle of least squares linear equations to find the constants and coefficients.* 2. The solution of linear equations* The procedure for solving linear equations, due to convergence problems using iterative method, instead of using the Gauss-Jordan elimination method to solve.