搜索资源列表
color.cpp
- 对于给定的图G，如果存在一种用2种颜色对顶点着色的 方案，使得图中任意一条边所连接的2 个顶点着有不同 颜色，则称图G 是可2着色的。-for the given graph G, if there is a use two colors of vertex programs, make a map arbitrary edge connected with two vertices are different colors, says G is 2-colored.
shujuku
- 对n个桶中不同颜色的砾石进行排序的数据结构文档-N months in barrels of different colors of gravel sort of data structure documentation
DS_ppt
- 某大学一个设计很好的数据结构课件，不少算法过程使用动画，版面颜色搭配得很好，是一个优秀的数据数据课件。-A university in a well-designed data structures courseware, algorithm process uses a lot of animation, layout colors very well and the data is an excellent courseware.
Maze
- 用栈解决迷宫问题，随机生成迷宫，而且还调用了 windows.h 实现了 windows 控制台字体变化，采用C++实现，注释很详细-Find a way through a maze with stack. The maze is generated randomly. Change the colors in console. Use C++ with detailed comments.
four-color-map-coloring
- 四色图着色问题，离散数学的经典算法，用c实现，输入一个图，用小于4种颜色着色-four-color map coloring, Discrete Mathematics classical algorithm, using c realize that the importation of a map, with less than four colors Coloring
BlackBound
- 有有一间长方形的房子 ，，地上铺了红 色、黑色两种颜色的正方形瓷砖。你站在其中 一块黑色的瓷砖上块黑色的瓷砖上，，只能向相邻的黑色瓷砖移只能向相邻的黑色瓷砖移 动。请写一个程序，计算你总共能够到达多少 块黑色的瓷砖块黑色的瓷砖 -There are a rectangular house between the rectangular house, to spread the red floor is covered with red and black co
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
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.
huichang
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数-Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as
256Alphe
- 在网站上看到过很多Alpha混合计算的相关文档，其中不乏经典之作，但大多数都是基于16位显示模式下的，而256色的却很少有人谈及。所以，决定写一个基于256色的Alpha混合算法的详细实现方法。以帮助那些初学者，给他们一点点小小的灵感：）-Alpha blending calculations related documents see on the site, many of them classics, but most are based on 16-bit display mode, 2
mapcoloring
- 已知中国地图,对各省进行着色,要求相邻省所使用的颜色不同,并保证使用的颜色总数最少。地图采用数据结构中无向图的存储结构存储，中国的三十四个省为三十四个节点，若两省相邻则存在一条边。任选一个节点作为初始节点开始着色，与其不相邻的边涂为相同颜色，然后再未涂色的节点中任选一节点重复上述步骤，直到所有节点均涂上色为止。-Known map of China, the provinces colored neighboring Province, the colors used, and to ensu
CPPjuanji
- 用C++实现卷积码的编码和译码，整个过程融为一体，可以实现从卷积码的编码到译码最后还原本来面目的全套实现-Full realization of the convolutional code encoding and decoding with C++ achieve integration of the entire process, and finally restore the true colors can be achieved from the convolutional code
kechongfuzuhewentixiangjie
- 有 n 个不同的元素，每个元素可以选多次，一共选 k 个元素，有多少种选法？例如， n=3,k=2 时，有(1,1), (1,2), (1,3), (2,2), (2,3), (3,3), 共 6 种选法。-There are n distinct elements, each element can be selected multiple times, for a total choose k elements, there are many kinds of election law?
arrangement
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 -Suppose you want to arrange a number of activities in the hall more than enough, and want
P610Permutation1
- this program print out all the possibilities of the permutation. there re 4 fruits, each one can have R G W three colors, print out all the combination-this program print out all the possibilities of the permutation. there re 4 fruits, each one can h
bicoloring
- 输入一个简单（无多重边和自环）的连通无向图，判断该图是否能用黑白两种颜色对顶点染色，使得每条边的两个端点为不同颜色。-Enter a simple (no multiple edges and loopback) connectivity undirected graph, determine if you can use this figure in black or white stained pair of vertices, so that the two ends of each si