搜索资源列表
zhaose
- 点击鼠标切换模式，有 点着色 共拥有6种图元-Click the mouse to switch modes, a little color has a total of six kinds of elements ~ ~
C0Compiler
- 用c写的c0文法的编译器，基本块内部的公共子表达式删除（DAG图）；全局寄存器分配（引用计数或着色算法）；数据流分析（通过活跃变量分析，或利用定义-使用链建网等方法建立冲突图）代码生成时合理利用临时寄存器（临时寄存器池），并能生成较高质量的目标代码；生成X86汇编 -C0 written grammar with c compiler
Syntax-Coloring-Control-VC
- 这个控件封装了能够在鼠标点击时链接到网页的超链接HyperLink控件，并把它们都集成到一个普通的按钮上。另外这个按钮支持32位图的图标。4这个文章实现一个简单的从CWnd继承下来的编辑控件，它具有语法着色功能-This package has been able to control your mouse, click on link to the page when the hyperlink HyperLink control, and they are integrated into a
OpenGLBasedFringeAndFont
- 使用OpenGL完成的云纹图及文字显示。云纹图支持等值线，支持连续与非连续着色，支持不同值区间的面积运算。全三维，已经过大量测试。-Use OpenGL achieve the moire maps and text. Moire map isogram Supported in support of consecutive and non-continuous shading, support for different values of the area of computing inte
Cognitivenetworkcoloringbasedongraphheorymodelofth
- 认知网络中基于图论着色模型的频谱分配算法的分析-Cognitive network coloring based on graph theory model of the analysis of spectrum allocation algorithm
aa
- 图的着色问题，可以使用四种颜色给一个地图上的不同地方着上不同的颜色，并且不超过四种颜色。-Graph coloring problem, you can use four kinds of colors to a different places on the map with different colors, and no more than four colors.
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
4
- 图的m着色问题 5个区域需要4种颜色来着色-Coloring
m_color
- 实现图的m着色问题,包括着色次数，具体着色的情况，可以用于地图填色。-m color
1112333
- 量子遗传算法应用于物理频谱分析，结果表明基于量子遗传算法的频谱分配算法性能明显优于颜色敏感图论着色算法-Quantum genetic algorithm is applied to the physical spectrum analysis, the results show that genetic algorithm based on quantum of spectrum allocation algorithm is superior to color-sensitive color
zhuosetu
- 本程序的功能是对图的着色，该算法主要是基于迭代回溯法，输出多种着色方案；若有n种颜色就输出n种着色方案。本程序有注释，通俗易懂。-The functionality of the program is the graphs, the algorithm is mainly based on iterative backtracking, the output multi-color scheme if n different colors on the output of n kinds of
binaries-2.0.5-win32
- 上传文件包括编译运行平台和许多实例。Answer set programming(简称ASP)是国外近几年兴起的一种重要的逻辑编程语言，对于求解NP问题有良好的时间上限优势。例如图的着色问题，哈密顿回路问题，sudoku问题，生物医学的特征选择问题等等。加上我上传的logic学习资料配套使用。-uploaded file include the compile and develop platform and many examples. Answer set programming is a
mcolor
- 图的m着色问题。 给定无向连通图G和m种不同颜色，用这些颜色为G的各顶点着色，是否有一种着色法使其中每条边两个顶点不同色。 Java实现。-Figure m-coloring problem. A given undirected graph G and m different colors, use these colors to the vertices of G, coloring, whether there is a coloring where each edge to two
fenxingchengxu
- 基于IFS、L系统的典型分形图的生成及其分形图的着色。-generation and rendering of typical fractal image based on IFS and L system
tuxiangchuli
- 各种图像的简单处理 包括灰度图、彩色图、直方图、着色处理-Simple treatment of a variety of images including grayscale, color map, histogram, shading, etc.
opengl
- 用OpenGL语言，输入点和点之间的连线关系，画出网状图，给图渐变着色，可选择着色，并对图进行移动翻转缩小放大，及纹理填充-With the OpenGL language, the input connection point and the relationship between the points, draw network maps, to map the gradient coloring, optional color, and reduce the enlarged map t
Graphalgorithm
- 图论算法实现，含树，欧拉圈，霍夫曼编码，图的连通性，着色树，最短路径等，且采用加载皮肤界面，界面美观-Graph algorithms, including trees, Euler circles, Huffman coding, graph connectivity, coloring trees, shortest paths, and the interface with loads of skin, beautiful interface
yichuan-c-chengxu
- 遗传算法解决图的着色问题，这里面都是源程序，很有用-Genetic algorithms to solve graph coloring problem, this all source code, very useful
M-graph-coloring-problem
- 通过鼠标绘制出该图的结构（可在菜单中设置打点和画线两种命令：当选择打点命令是，鼠标每点击一下则在屏幕上打一个点，当选择画线命令时，鼠标首先选中其中一个点，在选中另一个点时绘制出两个点之间的连线。当然也可采用其他方法完成图的绘制）。然后用不同的颜色来标识这些点，使得图中每条边连接的2个顶点着不同的颜色。在屏幕上应能显示出用不同颜色着色后的图。-Through the mouse to draw out the structure of the graph (which can be set in