sxdicss

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

Prim算法（节点可任意选定） Prim算法（节点可任意选定）-prim algorithm

直接下载，用vc++6.0打开 可直接运行，数据库为access2003，语言为vc++，适合初学者 直接下载，用vc++6.0打开 可直接运行，数据库为access2003，语言为vc++，适合初学者

一个判断输入的一个时间是否为瑞年的简单算法，也于大家分享吧！-a judgment entered a time for the Swiss, a simple algorithm, but also to share with you!

摘要：可以对本地数据库进行查看，修改的程序，提供了源代码。-Abstract : It is the local database view, the procedures for amendment, the source code.

遗传算法的源程序，用于多组分样品的拉曼光谱的分析的C语言原程序 -genetic algorithms

一个很好的C语言开发的函数库接口, 可以节省很多开发时间, 可以好好看看哦(A good library of C language development interface, you can save a lot of development time can have a good look.)

我自己从oracle 805 提取得oracle精简客户端程序并且自己开发了一个添加tns的小工具-myself from the oracle oracle made mention 805 client streamline their procedures and the development of a small add tns tools

最小生成树算法 克鲁斯法尔算法 球最佳路径-kulru method class maiun void cx

这里包含有数据结构中所有的的算法和代码，非常适合学习数据结构的人，有栈，队，链表，图等等经典算法，非常适用(It contains all of the data structure algorithms and code,which is very suitable for starte learning data structures, such as stack, team, list, graph and so on ,it is very useful)