A complete bipartite graph is a graph with two sets of vertices where there is no edge between vertices belonging to the same set; but all vertices of different sets are fully connected. Draw the K(10,10) where each set have 10 vertices.
We have project that draws fully connected 24-gon. Use colorsys library to gradually change the hue of lines as they get longer.
Refer to fully connected octagon before drawing this fully connected 24-gon.
Use nested for loop and list to draw the following fully connected octagon.
Use loops to draw the following shape:
Today’s computer monitors and TVs consists of a lot of tiny Red, Green, and Blue pixels. By adjusting the level of brightness of these three pixels, we can make all other colors we see on screen. In this project, we are going to test this ourselves.
Draw a matrix of small dots in red, green, and blue with the pattern shown below:
Now make the dot much smaller and fill up the same space. You should see something like below. The vibrant colors of previous picture disappears and we see a gray color.
Let’s turn off the blue dots by replacing them with black dots. Only red and green dots remain. Does it display some yellow color as shown in below?
Try creating spring green color as shown below:
We have a random maze generator project. Try to generate a circular maze. The entrance is at the top and exit is at the center. Again, make sure there is path from entrance to exit while making the maze hard to solve.
You drew a spider web in a previous project. Draw a spider web with a hole at the center.
You created a random letter matrix in a previous project. Write a program that generates a random word search table given a list of words. You will practice list, string in the project.
Generate a matrix or random letters from A to Z.
