搜索资源列表
PS-shader
- D3D的像素着色器示例,分别实现了多重纹理化,彩色图去色,图像左右镜像,上下镜像以及浮雕图效果-D3D pixel shader example, were to achieve a multi-textured, color map to color, about the mirror image, the mirror up and down, and relief map results
1234
- 点击菜单上的“图像处理”->可以对位图进行灰度化、亮度改变、自定义着色,点击钝化、锐化,都可以在下拉菜单中选择三种以上的算法来处理图像,此外,还我做的自定义3*3模板,处理图像。-Click on the menu " Image" -> can be grayscale bitmap, brightness change, custom color, click on passivation, sharpening, can be in the drop-down
zhaosewenti
- 对于给定的图G,如果存在一种用2种颜色对顶点着色的方案,使得图中任意一条边所连接的2 个顶点着有不同颜色,则称图G 是可2着色的。-For a given graph G, if there is a vertex with two colors on the color scheme, making the graph an edge is connected to any two vertices with different colors, called graph G is 2 colo
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
2color
- 对于给定的图G,如果存在一种用2种颜色对顶点着色的方案,使得图中任意一条边所 连接的2个顶点着有不同颜色,则称图G是可2着色的。 -For a given graph G, if there is a program of two kinds of color on the vertex shader, so any one edge Connect two vertices with different colors, then G can be 2-colored.
Graph-theory-and-applications
- 图论及应用 了解图的基本概念如树、图的连通性、Euler图、Hamilton图,以及图的匹配与因子分解,还有平面图和图的着色,有向图,图、群与矩阵-Graph theory and applications、 Euler Graph、 Hamilton Graph、Connectivity of Graph
Color_Graph
- 求解无向图的三着色问题,给出所有着色方案-Solving undirected graph coloring, given all the coloring scheme
Graph-theory
- 本文档主要讲解了基于图论着色的动态频谱分配研究,可以让大家快速的学习认知无线电中的频谱分配-This document is mainly on the dynamic spectrum allocation based on graph coloring theory research, so that we can quickly learn the spectrum allocation in cognitive radio
t6u3vw.ZIP
- 一种改进的颜色敏感图论着色算法An improved color sensitive graph coloring algorithm-An improved color sensitive graph coloring algorithm
10_color
- 图的着色问题 用vc++编译环境写的简单实用的代码-graph coloring the source code
colorgraph
- 网络波长分配中的着色图算法,遵循波长一致性条件和不同波长限制条件。-it s the color graph algorithm,which is applied to the wavelengths assignment in the WDM networks.
ssimmulatedani
- 模拟退火算法求解经典图论中的图着着色问题的源程序源码 -Simulated annealing algorithm for coloring problems in classical graph theory diagram with source code
PicThery
- 这个程序实现与Matlab的优化工具箱下,用于给图进行边着色。包含了很多图论的程序,如计算最大割集、连通度、最小覆盖边数等等…… -This program is implemented with Matlab Optimization Toolbox for graph edge coloring. Contains a lot of graph theory program, such as the calculation of the maximum cut sets, connect
GCP
- 图的M着色问题的C/C++实现,给定M后,给出具体着色方案。-M coloring the C/C++ achieve, given M, given the specific coloring.
Coloring
- 算法设计与分析 王晓东版本 采用java编写 图的m着色问题完整代码-M coloring problem complete code written using java graph algorithm design and analysis Wang Xiaodong version
newfile5
- 【例6.4-1】本例演示:pcolor , contour, contourf的调用格式;等位线标高指令 clabel 的配合使用和区别;colorbar在用户指定位置上创建着色标尺;subplot子图位置的控制;图形窗背景底色的设置。(图6.4-1)-Example 6.4-1 This example demonstrates: pcolor, contour, contourf' s call format the bit line elevation instruction cl
mapcoloring
- 已知中国地图,对各省进行着色,要求相邻省所使用的颜色不同,并保证使用的颜色总数最少。地图采用数据结构中无向图的存储结构存储,中国的三十四个省为三十四个节点,若两省相邻则存在一条边。任选一个节点作为初始节点开始着色,与其不相邻的边涂为相同颜色,然后再未涂色的节点中任选一节点重复上述步骤,直到所有节点均涂上色为止。-Known map of China, the provinces colored neighboring Province, the colors used, and to ensu
exprdlg
- 本源代码在工具栏中加入了组合框,并且采用了自绘功能来实现列表项以不同的着色来显示项来对应函数图的着色,在此源程序中,你可在组合框中输入函数表达式(当然也可以加入X自变量),按回车后就可在视图中显示你所输入的表达式图,并在组合框中以对应的着色加入表达式字符。-Source code added in the toolbar combo box, and uses a self-drawn list items to display different colored items correspon
tulun
- matlab图论着色,内涵可以实现简单的图论着色源代码,实现计算色的多项式等功能-the matlab graph theory coloring