Uncolored | colored — Next generation desktop rich content editor | Editor library

Question:

Given a graph G = (V,E) a k-coloring of G is a labeling of the vertices with the colors c_1, c_2, ..., c_k such that for every edge (u,v) the color of u is different from the color of v.

A. Give a linear time algorithm that finds a 2-coloring for a tree.

B. Think about coloring a tree with two colors so that you have the maximum number of nodes colored c_1. Prove that your algorithm from part (a), with a minor modification probably, can be used to solve this problem. Be precise.

C. Show an example of a tree, T, that can have at most j nodes colored c_1 in a 2-coloring but T can have j' > j nodes colored c_1 in a 3-coloring. Try to find the smallest example of such a tree T.

D. Give a linear time dynamic programming algorithm that creates a 3-coloring for a tree such that the maximum number of nodes are colored c_1. Justify your answer.

What I have:

Parts A and B seem rather simple, but I am struggling on C and D

A. This seems simple, run DFS, but modify it so if it

1. encounters an uncolored node color it c1 and its children c2,

2. encounters a colored node color its children the opposite color

3. if it ever tries to "flip" the color of a child, then return that it is impossible to have k-coloring

This is just DFS, so will run at O(V+E)

Edit: Since this a tree you can call BFS on a random node, alternating colors in the BFS

B. Since this is a binary first choice (ie c1 or c2) and all choices follow from the first choice, we can simply calculate which is superior coloring the first node c1 or c2. We can do this by adding a counter to the above algorithm calculating the number of c1 nodes. Run the algorithm twice once starting with c1, then with c2, compare the number of c1 nodes between the two, and then pick the graph with more c1 nodes

C. Been fiddling with this for a while and can't find a single one, much less the smallest one possible

Edit: 1-3, 2-3, 3-4, 4-5, 4-6 described by Bing Wang works here

D. No idea. I assume you are going to have to be using a modified DFS to have it run at linear, but am extremely unsure beyond that. I can come up with ways to brute force it, but nothing that runs at linear.

Edit: Still confused about this

I want to make a showModalBottomSheet with a container in Flutter. I want this container to have rounded the top borders but, when I tried this, there are a few small uncolored spaces in the corners. How can I delete them?

This is the code I used:

Im trying to iterate through an array which returns "notes" as seen below. I have two fields called state and baseType which mean the following:

state: The number of messages to show

baseType: The number of messages to show colored

Im able to print the first three colored (check HTML) but I dont know how to print only the 4th note or however many come afterwards uncolored. I print all 4 of them again but uncolored.

What I have so far

CONTROLLER

I am trying to show different growing season lengths by displaying crop planting and harvest dates at multiple regions.

My final goal is a graph that looks like this:

which was taken from an answer to this question. Note that the dates are in julian days (day of year).

My first attempt to reproduce a similar plot is:

My app is using an array of div elements to display a grid. The array is stored in Context so other components can access the data but I'm not sure if that matters in this case. I have an onClick function that changes the CSS class of a clicked-on element, so that it has a colored background. This works fine, and toggles properly.

I want to remove all selections if the grid is changed to a smaller size. I tried a few approaches and got some strange behavior as a result, culminating in some very confusing behavior from this code:

Can understand why the rectangle that get color (when checked) and uncolored (when unchecked) isn't take all the place (please find attached screenshot). Try to investigate the issue but didn't come to any conclusion. Hope that someone can help me here The layout xml is:

So I'm using ggplot2 to plot both a bar graph and points. I'm currently getting this:

As you can see the bars are nicely separated and colored in the desired colors. However my points are all uncolored and stacked ontop of eachother. I would like the points to be above their designated bar and in the same color.

I have an uncolored geom_col and would like it to display information about another (continuous) variable by displaying different shades of color in the bars.

Starting with a geom_col

Say I have a multicolored map of the United States, and I want to know how many pixels in a particular state (Nevada, for example) are purple, how many are green, and how many are white. Can I do this with OpenCV?

I've tried to tackle this by turning each state on an uncolored "basemap" into its own contour using cv2.drawContours, then overlaying the two images (This is where things start to feel wrong).

I know that I can then use the following: