搜索资源列表
home1work
- 微软桌着色问题a【问题】 组合问题 【问题】 填字游戏 【问题】 n皇后问题 -Microsoft tables coloring problem -- a problem [[composition problems -- crossword puzzles [n Queen's problem -- the problem
Text3
- 利用C语言中的回溯法对图案的着色问题进行解决并检查颜色可用性生成邻接矩阵-use of the C language law back to the logo coloring problem solving and check availability of generating color adjacency matrix
算法第一次实验
- 着色问题,输入一个图和颜色的种数,要求有邻边的两个顶点不能着同一种颜色,找出所有的着色方案-coloring, the importation of a color map and the number of categories, and a two adjacent edges of the peak is not the same color, identify all the coloring program
5地图染色d
- 基于C++的MFC实现的地图着色问题。对于使用文档/视图模型的 MFC 应用程序。-based on C + + MFC map rendering issues. The use of Document / View model MFC applications.
LICOLOR
- 是一个有关图着色问题的程序,C语言写的,程序很短,但是所用的算法很新-The plan is a rendering of the procedures, written in C language, procedures are very short, but by the very new algorithm
colorprogram
- 着色问题,通过贪心算法实现,个人认为还比较经典
color2
- 这是我编的关于着色问题的C程序,我的程序已经通过编译了,直接可以运行-This is my series on the C coloring process, I have been through the process of compiling a direct run
mColor
- 图论:图的M着色问题 GraphM.h GraphOpr.h mColor.cpp mColor.dsp mColor.dsw mColor.h mColor.ncb mColor.opt mColor.plg test test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mC
ditucaixiang
- 地图着色问题又称为“四色问题”,四色问题的内容是:“任何一张地图只用四种颜色就能使具有共同边界的国家着上不同的颜色-map also known as the "four color", the four-color problem is the content : "Anyone with a map of only four colors will be able to have a common bo
mcolor+maxtree
- 这个代码包括求图的最大生成树和M着色问题.-this code includes plans for the biggest tree and M coloring problem.
setColor_pro
- 经典的着色问题,数据结构,本代码由本人自己编写,VC++版本-classic color issues, data structure, the code from my own preparation, the VC version
myAlgorithmExamplesAndExplain
- 都是自己编写的常用算法的事例,本人础作. 里面有:哈密尔顿环,皇后问题,图的着色问题,子集和数问题,树和等价问题,栈的各种用发等.-themselves are prepared by the algorithm commonly used examples, I make foundation. There are : Hamilton Central, Queen's, graphs, and several subse
GCP(color)
- 该程序是经典得MATLAB应用,关于模拟退火应用中得GCP图着色问题-the program MATLAB is a classic application of simulated annealing applications in the GCP map coloring problem
Bird4
- 四色图着色问题,离散数学的经典算法,用c实现,输入一个图,用小于4种颜色着色-four-color map coloring, Discrete Mathematics classical algorithm, using c realize that the importation of a map, with less than four colors Coloring
t
- 回溯经典-m图着色问题(和地图4色问题的区别) - train的专栏 - CSDN博客-Back classic-m graph coloring problem (and the 4-color map problem of difference)- train column- CSDN blog
GrTheory-Matlab-toolbox
- 图论应用研究广泛,如最短路问题,最小生成树问题,最大费用流问题,最优匹配问题,网络可靠性问题,图的着色问题,最优序列设计问题,等等。这是一个强大而通用的基于matlab的工具箱 -Graph toolbox
tuzhuode
- 利用模拟退火法解决图着色问题,画出相应的图形,效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
simulated annealing algorithm
- 模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the
图论着色的相关代码分析
- 此为大四的毕业设计论文的相关代码,题目是《有关图论着色问题非算法模型的建立与设计》,代码成功率极高。且多方面对图论着色进行了分析,同时也是这份代码被评为了优秀毕业设计论文。(This is the code of graduation thesis for senior students. The topic is "the establishment and design of non algorithmic model f
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法,它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点,本算法用来解决最短路径问题,并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that