comdemo

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

蜂窝小区 matlab的仿真 实测可以运行(matlab The simulation of in honeycomb cell can run.)

相关组合导航代码，希望可以帮到大家。十分感谢。(Associated integrated navigation code)

介绍电烙铁的使用，非常好的资料。值得学习和收场。(introduction of dianlaotie,it very good information of dianlaotie. useful to study and get.)

说明：  根据洗浴事件识别模型，对不同地区的用户的用水进行识别(According to the bathing event recognition model, the water consumption of users in different areas is identified)

说明：  程序附了多项式的图，可以输入需要的项数，比如N=2,M=2，即可在单位圆（默认多项书系数是1）生成像散图像(The program is about the generation of Zernike polynomials)

说明：  小波变换一直被广泛的应用数微波成像处理当中， 总结了小波变换的相关论文(Wavelet transform has been widely used in microwave imaging processing. The related papers of wavelet transform are summarized)

C常用算法程序集－徐士良著 经典，学习c语言的好冬冬啊-C algorithms commonly used procedures set-XU Shi-liang classic book, learning the language c good kick ah

一个小的文件分割器。-a small file dividers.

这是一个用multisim编写的时钟，主要由芯片级联而成-This is a clock with Multisim prepared mainly by the chip cascade from