搜索资源列表
tuzhaosewenti
- 图着色问题,最基本的问题,贴出代码供大家了解,可以清楚的看到,希望大家能喜欢-Graph coloring problem, the most fundamental problem, posted the code for everyone to understand that you can clearly see, I hope you like it
MNTH
- 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中,存在着大量的组合优化问题。例如,货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等,这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electro
MIT_AI_lec_03
- 麻省理工的人工智能讲义第三章 约束满足问题 介绍了各种类型的约束满足问题-AI lecture-3 of MIT talking about Constraint Satisfaction Problems (CSPs):N-Queens problem;line labelings;Graph coloring;3-SAT; Model-based recognition etc.
PSO
- 粒子群优化算法的源程序代码 经验证是可行的-Personal collection of a directed acyclic graph support vector machine for multi-classification problems
ant_algorithm
- 基于蚁群算法的图的着色问题的研究,毕业论文做的,还是挺好用的-Ant colony algorithm based on graph coloring problem of the studyThesis done, or very good use
tdzs
- 图的着色问题的c++实现,实现平台visual studio 2008-Graph coloring problem c++, platform Visual Studio 2008
Color_Graph
- 求解无向图的三着色问题,给出所有着色方案-Solving undirected graph coloring, given all the coloring scheme
t6u3vw.ZIP
- 一种改进的颜色敏感图论着色算法An improved color sensitive graph coloring algorithm-An improved color sensitive graph coloring algorithm
huichang
- 假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数-Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as
suanfa
- 相当经典的图着色算法,一个ppt ,还有一个算法实现,十分浅显易懂。-Quite the classic graph coloring algorithm, a ppt algorithm is very easy to understand.
10_color
- 图的着色问题 用vc++编译环境写的简单实用的代码-graph coloring the source code
GGCPPrarC
- GCP(图着色问题)的模拟退退火算法应用源码 -GCP (graph coloring), simulated annealing annealing algorithm application source code
opengl_qt_draw3D
- 四棱锥由5个面构成一个封闭的立体图,其中4个共顶点的侧面是三角形,底面是个四边形。如果我们要绘制一个3D的四棱锥只需要绘制这5个面即可,绘制的方法和前一篇文章OpenGL_Qt学习笔记之_03(平面图形的着色和旋转)的相同。只不过这里的顶点坐标是3维的,所以图像深度那一维不一定为0。因此我们可以事先计算好四棱锥各个顶点的坐标,这对学过立体几何的人来说应该是小case了。然后绘制每个面就可以。 注意,在opengl中绘制每个面时,所有面给出的顶点的顺序都要按照逆时针或者顺时针(我这里采用的
traffic
- 图着色解决交通管理问题,用Turbo C 2.0和windows XP 系统-Graph coloring to solve the problem of traffic management, Turbo C 2.0 and windows XP system
Matlab_test
- 寄存器分配,采用图着色算法进行处理,简化处理时间-Register graph coloring
Coloring
- 算法设计与分析 王晓东版本 采用java编写 图的m着色问题完整代码-M coloring problem complete code written using java graph algorithm design and analysis Wang Xiaodong version
n-queen
- N皇后问题、图着色问题、矩阵连乘问题代码实现-N-queens problem, graph coloring problems, matrix multiplicative code implementation
Graph_coloring-CSharp
- graph coloring in C#
2dz.tar
- Solution of 3 graph coloring problem. Uses C/C++ programming language.
psograph1
- particle swarm optimization algorithm for graph coloring using java