colorable | A simple color handler which provide a conversion

I am struggling to deploy a simple Go app to Google App Engine flexible environment. (This is a very cut-down version of a larger app.) When I run gcloud app deploy --project= it terminates with an error, and has this in its output:

Laravel 5.8. I have a table cats:

I am trying out Go modules. My project requires the libarary golang.org/x/net/html, so I defined this go.mod file:

Design an interface named Colorable with a void method named howToColor().

Design a class named Triangle extending GeometricObject and implementing Colorable.

Triangle implements howToColor method to display the message "Color all three sides".

Triangle implements thetoString method to display its color and its sides.

In a triangle, the sum of any two sides is greater than the other side. The Triangle class must adhere to this rule. Create the TriangleException class, and complete and implement the constructor of the Triangle class to throw a TriangleException object if a triangle is created with sides that violate the rule.

The output of the test program should be as indicated below.

I am writing a code to determine a k-colorable Graph. I am using immutable Maps to determine vertices colors on backtracking.

On the second interaction of a flatMap loop, my Map lost an element. I couldn't be able to write a more concise example that would present the same bug, then here it is my entire code:

Matplotlibs discrete colorbar is missing one color define in my color map, and also used in the plot.

In my example code I have seven colors, but the colorbar only shows six colors, though the code for creating the colormap and colorbar seems identical to examples I found on the internet. The color red witht eh label "180" is missing. Even if I changed the boundaries and ticks either the beige-ish color or the light-blue color is extended in the colorbar.

I'm using "glide" to manage my go packages, here is my glide.yaml:

is there an algorithm to know if a tree is colorable or not? Because I found this phrase on Wikipedia:

The path from the root to the farthest leaf is no more than twice as long as the path from the root to the nearest leaf.

So, for example, taking in exam these two trees:

In the first one the shortest path from the root is the one on the left and it has a distance of 1 from the root. The longest one is on the right and has a distance of 3. So 3 is not <= 2*1, so the tree on the left is not colorable, right? In the second tree the shortest path takes 2 nodes and the fastest takes 2 nodes too. 2 <= 2*2 so it is colorable I guess.

I have a graph coloring program that takes in a 2D array as an adjacency matrix and colors the graph based on that adjacency matrix. This file is Color.cpp. I have another program that creates this adjacency matrix and puts it in a text file, this program AdjacencyMatrix.cpp.

When I originally created the coloring program, I hard coded the adjacency matrix into the 2D array graph[V][V] where V is the number of vertices.

These are two separate programs, I was just copying and pasting the adjacency matrix created by AdjacencyMatrix.cpp into Color.cpp.

Because my program already creates a file with the adjacency matrix in it, I want to have my coloring program read that file. I know best practice is to combine them and have the matrix stored in the array passed into the coloring program in one cohesive program. I think reading a file is my simplest solution at this point, but if more experienced users can show me how to store the matrix in a data structure and pass it into the coloring program, I welcome it.

AdjacencyMatrix.cpp

This program takes in a file that is a string of integers listed as adjacent pairs and creates an adjacency matrix from it, then stores it in a file. The file "24cell_skeleton.txt" is the file it reads in and "out.txt" is the file it prints the matrix into.