本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用...

演示Kruskal算法和Prim算法 集合的并,元素查找的操作及应用 说明: 代码均在vc++6.0环境下编译均通过 在非VC++6.0环境下编译请去掉头文件 windows.h 和函数 end() -Demo Kruskal algorithm and Prim algorithm and collection, elements of the search operation and application notes: code in vc++ 6.0 compiler environment through in non-VC++ 6.0 compiler environment please go to the U-turn paper windows.h and function end ()

数据结构与算法-程序、素材---使用矩阵类-Data Structures and Algorithms- procedures, materials--- the use of matrices

二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal

用链表存贮结构实现线性表的基本操作。（包括各种操作）-List storage structure used to achieve the basic operation of the linear form. (Including a variety of operation)

操作系统编程实验报告，呵呵，从老师的电脑里偷来的。-OS programming experiment, huh, from the teacher"s computer stolen.

数据结构作业题，堆栈和队的使用（大写字母表示魔王语言的词汇；小写字母表示人的词汇语言；魔王语言中包含括号）-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)

数据结构霍夫曼编码译码程序-data structure Hoffman codecs procedures

要控制我的信息系统是一个非常聪明的简单的项目。你可以学习如何添加、 更新、 删除和查询与 php mysql 语言......

ArkoMaster端系统模块设计文档 系统管理软件自主开发软件。 系统管理软件A实现最终目标：是可以自由横跨桌面（Desktop）、Client/Server、大型主机的不同层次的管理，管理的对象包括应用程序（Applications），数据库(Database)，网络(LAN, WAN)，系统平台(System Platform)和互连网Internet/Intranet等五个方面。-End system ArkoMaster modular design their own document management software system to develop software. A system management software to achieve the ultimate goal: It is free across the desktop (Desktop), Client/Server, mainframe different levels of management, including management of applications (Applications), database (Database), network (LAN, WAN ), system platforms (System Platform) and the Internet Internet/Intranet and other five areas.

实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path