设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试...

队列相关的所有基本算法，西电的老师写的，与吴伟民数据结构课本完全一致，用C实现-cohort of all the basic algorithm, the West-- written by the teachers, and textbooks Xiulan WU Weimin data structure is fully consistent with achieving C

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

可用代码生L成SQL Server用户表的表结构定义，包含字段/类型，可选择是否打印索引/约束/注释等

数据结构 基础要好-better data structure foundation

资源描述delphi 制作的电梯程序,智能控制上下人数,停留层完全按照实际操作来,设计结构精细,适合练手.组件简单

这是一个物资管理系统，有些错误，还请大家更正！-This is a materials management system, some errors, but also please correct!

大二上学期在学校的数据结构实验课程设计课上自己出于兴趣写的一个郝夫曼树的应用，而课本上的程序不能直接使用，初学者学起来会很困难呢，而我的这个程序有具体的实现，详细的源码介绍，希望对初学者有帮助！

用c写的数据结构链表的操作，包括关于链表的系列操作-used to write the data structure Chain operations, including a series of Chain Operation

本程序使用Visual C++6.0编写，使用了MFC，数据库用的是SQL Server，要正常运行本程序，请安装该数据库，并参看压缩文件中的DBConfig.ini文件。本程序如果和已经上传的NetControlManager已经完全可以满足用户对局域网控制的需求，特色功能包括：登陆认证、局域网内特定IP上网限制等-This procedure using Visual C++ 6.0 preparation, the use of the MFC, the database used is SQL Server, to the normal operation of this program, please install the database and see the compressed file in the document DBConfig.ini. This procedure has been uploaded If NetControlManager has been fully able to meet user demand for LAN control, features include: login authentication, LAN specific IP access restrictions

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-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! !