搜索资源列表
算法第一次实验
- 着色问题，输入一个图和颜色的种数，要求有邻边的两个顶点不能着同一种颜色，找出所有的着色方案-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
LICOLOR
- 是一个有关图着色问题的程序，C语言写的，程序很短，但是所用的算法很新-The plan is a rendering of the procedures, written in C language, procedures are very short, but by the very new algorithm
myAlgorithmExamplesAndExplain
- 都是自己编写的常用算法的事例,本人础作. 里面有:哈密尔顿环,皇后问题,图的着色问题,子集和数问题,树和等价问题,栈的各种用发等.-themselves are prepared by the algorithm commonly used examples, I make foundation. There are : Hamilton Central, Queen's, graphs, and several subsets, trees and equivalence, the
C0Compiler
- 用c写的c0文法的编译器，基本块内部的公共子表达式删除（DAG图）；全局寄存器分配（引用计数或着色算法）；数据流分析（通过活跃变量分析，或利用定义-使用链建网等方法建立冲突图）代码生成时合理利用临时寄存器（临时寄存器池），并能生成较高质量的目标代码；生成X86汇编 -C0 written grammar with c compiler
tabucol
- 关于图着色问题中禁忌搜索算法的讲解，适合新手使用和学习-Tabu search algorithm on the graph coloring problem explanations, suitable for beginners to use and learn
NodeColoringTabu
- 在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn