搜索资源列表
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 mColor.dsw mColor.h mColor.ncb m
Cognitivenetworkcoloringbasedongraphheorymodelofth
- 认知网络中基于图论着色模型的频谱分配算法的分析-Cognitive network coloring based on graph theory model of the analysis of spectrum allocation algorithm
puzzle
- 请设计算法，使用至多4种不同颜色对七巧板进行涂色（每块涂一种颜色），要求相邻区域的颜色互不相同，打印输出所有可能的方案。 提示：可以把七巧板上的每个区域看成一个顶点，若两个区域相邻，则相应的顶点间用一条边相连，这样将七巧板转换为图，该问题实质上是一个图的搜索问题。 -Please design algorithm, using up to 4 different colors for coloring on the puzzle (each block of color coated),
Graphalgorithm
- 图论算法实现，含树，欧拉圈，霍夫曼编码，图的连通性，着色树，最短路径等，且采用加载皮肤界面，界面美观-Graph algorithms, including trees, Euler circles, Huffman coding, graph connectivity, coloring trees, shortest paths, and the interface with loads of skin, beautiful interface
2-SAT
- 本文详细介绍了2-STAR算法，此算法在图论里面具有较高的地位，本文详细推到了染色算法的时间复杂度O(e).具有较高的学术价值。-This paper describes a 2-STAR algorithm, the algorithm in graph theory, which has a higher status, the paper pushed to the coloring algorithm of time complexity O (e). Has high academic
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
9klmn4.ZIP
- 一些分裂图的点可区别全染色Some split graph vertex distinguishing total coloring of-Some split graph vertex distinguishing total coloring of
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
tianchong
- 利用填充算法，借助栈的结构，完成对图形的填色过程。先画出封闭图形，然后使用填充对其涂色。-Filling algorithm, with the structure of the stack, complete the coloring process graphics. First to draw closed graph, and then use fill its coloring.
exp5
- 输入一个图形的各个顶点 ，绘制图形，并且给这图形填色-Input to each of the vertices of a graph, draw graphics, and coloring for this graphic
tulun
- matlab图论着色，内涵可以实现简单的图论着色源代码，实现计算色的多项式等功能-the matlab graph theory coloring
tulun
- 图的着色问题的计算程序，根据输入的矩阵计算-Calculation program graph of coloring problem，base on the input matrix to calculat
jiyutulun
- 基于图论的多叉路口相位设计方案 用图论的方法计算出一个多叉路口用信号控制的情况下所需的最优相位个数。至于这种相位个数能不能达到交叉路口的最大通行容量，以及最短的排队时间和排队长度，都不在本文研究的范围之内，因此，未来可以根据本文提供设计的相位个数来研究上述问题。-The intersection is the “bottleneck” of the road network’s traffic capacity and the “Multi-happening” of traffic acc
GreedyColoring_MATLAB
- Calculate and color the graph using greedy algorithm with matlab
启发式算法
- 利用启发式算法解决图着色问题，包括禁忌表，仇人表等一系列操作(Solving the problem of graph coloring with heuristic algorithm)
ColorGraph
- 在D2D模型中使用图着色方法进行仿真的程序(Programs that use the graph coloring method for simulation in the D2D model)