Algorithm for four

本程序是一个校园导游咨询系统，提供校园内各景点的信息咨询和最点路径查询功能。-This procedure is a consultation system for the campus tour guides, provide campus information tourist attractions and the most points the path of the inquiry.

数据库操作功能类，包括添加，修改，删除等操作。直接调用就可以。-Database operations functional categories, including add, modify, delete, etc. operations. Can be called directly.

背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program

企业事务管理系统-Enterprise Management System

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

Access数据库经典模板，Access-DateBase-Template.rar-Classic template Access database, Access-DateBase-Template.rar

稀疏矩阵的十字链表算法-sparse matrix algorithm Cross Chain

这是将中缀表达式转换为后缀表达式的代码。中缀到后缀转换使用堆栈。各种使用的函数包括基本堆栈操作，如overflow（）、int underflow（）、void push（）、int pop（）、int peep（）、void display（）等。

数据结构：用链表做存储结构求两个一元多项式相加的结果-Data structures: The linked list storage structure seeking to do two one dollar sum of the results of polynomial

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)