搜索资源列表
graphtheoryprogram.rar
- 有关图论程序，用matlab编写的，可进行顶点染色和边染色,Procedures related to graph theory, and the preparation of the matlab can be carried out vertex coloring and edge coloring
ant
- 关于地图着色问题的蚁群搜索算法，启发式搜索算法的改进-Map Coloring Problem on ant colony search algorithm, heuristic search algorithm to improve
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
PlanarColor
- 对地图的着色，找出最少的颜色数目。 对于颜色=3的时候，直接返回4.-The coloring on the map to find the least number of colors. For color = 3, when the direct return of 4.
vcf-1.0
- VC++下的三维重建的开发框架 主要是基于多图像输入下对物体进行重建过程而使用体素着色法-VC++ under the three-dimensional reconstruction of the development framework is based mainly on the multi-image input to the reconstruction process of the object using voxel coloring
Best_pseudo_coloring_idea
- A code for pseudo coloring the images
Lab9
- It s an application for general graphs...including traversing and coloring algorithms...and a test programm for testing those features.
Shen
- graph coloring with GA
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
0712253
- I wrote this program for coloring any map with only 4 colors. Input for it is an bitmap file with 24 bit colors (must gray/scale). Output is a bitmap which is colored with maximum 4 colors.
Coloring_a_graph_using_split_decomposition
- A solution for Graph Coloring problem Coloring a graph using split decomposition
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
Basedonthecognitivenetworkofgraphcoloringmodelofth
- 本文研究了认知网络中基于图论着色模型的频谱分配算法。-This paper studies the cognitive network model based on graph theory spectrum allocation algorithm for coloring.
color1
- 给定无向连通图G和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点 着一种颜色。是否有一种着色法使G中每条边的2个顶点着不同颜色。这个问题是 图的m可着色判定问题。若一个图最少需要m种颜色才能使图中每条边连接的2个 顶点着不同颜色，则称这个数m为该图的色数。求一个图的色数m的问题称为图的 m可着色优化问题。 -Given an undirected connected graph G, and m kinds of different colors. With thes
wheel1
- Wheel Graph Coloring algorithm
source
- Very good collection of c++ source code. Implementation of diffrents alghoritms in graph theory, such as floyd,fulkerson. dijkstra,warshall, binary tree,map coloring,vertex cover.
C.design.text.code.coloring
- C设计文本代码着色开发经典代码C development of the classic design of the code text code coloring -C development of the classic design of the code text code coloring
coloring
- Coloring algorithm with greedy method in C-Coloring algorithm with greedy method in C++
coloring-process
- 染色问题程序，适用于matlab开发环境-Coloring process, development environment for matlab
A-backtrack-based-program-for-coloring-graphs.tar
- A backtrack based program for coloring graphs