各种排序的程序，应用多种数据结构

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

数据结构自考试题及答案 希望能够帮助大家-Data structure questions and answers to help everyone

这是一个用PB和SQL SERVER做的课程设计,模拟完成了,银行的开户,销户,存款,取款等功能.-with PB and SQL SERVER do curriculum design, simulation completed, the bank accounts, and marketing of households, deposits, withdrawals and other functions.

access dao 数据库-access dao database

考勤管理系统-Attendance Management System

本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical application

利用TreeCtr控件访问数据库-use TreeCtr controls access to the database

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

成绩分析系统 可分析学生几个学期以来的学习状况-performance analysis system can be analyzed several students since the semester learning

ORACLE数据库的很好的PPT教程，希望对大家有所帮助-ORACLE database PPT excellent tutorial we want to help