搜索资源列表
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
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
n-queen
- N皇后问题、图着色问题、矩阵连乘问题代码实现-N-queens problem, graph coloring problems, matrix multiplicative code implementation
2dz.tar
- Solution of 3 graph coloring problem. Uses C/C++ programming language.
Graph_coloring
- This Code solve the graph coloring problem by genetic algorithm.
exprdlg
- 本源代码在工具栏中加入了组合框,并且采用了自绘功能来实现列表项以不同的着色来显示项来对应函数图的着色,在此源程序中,你可在组合框中输入函数表达式(当然也可以加入X自变量),按回车后就可在视图中显示你所输入的表达式图,并在组合框中以对应的着色加入表达式字符。-Source code added in the toolbar combo box, and uses a self-drawn list items to display different colored items correspon
test_sol-2.3
- solution test for graph coloring linux code
GCP
- 着色问题,是最著名的NP-完全问题之一。 给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the se
spectrum-allocation-color-algorithm
- 频谱分配算法,采用图着色的比例公平分配算法-Spectrum allocation algorithm, using the ratio of equitable distribution graph coloring algorithm
PicColor
- 用回溯法解决图着色问题,用回溯法解决图着色问题-Use backtracking to solve graph coloring problem
register-allocation-algorithm
- 图着色方法图,适用于寄存器分配 采用的是经典退火算法 -Graph coloring register allocation classic annealing algorithm
coulor
- 用我们所写的C++程序去实现我们想要得到的图形的染色-With our C++ program written to achieve what we want the graph coloring
tuzhuode
- 利用模拟退火法解决图着色问题,画出相应的图形,效果较好-Using simulated annealing method to solve the graph coloring problem, draw the appropriate graphics, better