Challenge: Color the Graph
Use the fewest possible colors, to color the vertices of a graph such that no two adjacent vertices are the same color.
We'll cover the following...
Problem statement
Graph coloring involves finding a way of coloring the vertices of a graph.
Implement a function that finds a way of coloring a graph so that no two adjacent vertices are colored using the same color. ...