README.md

Finds an approximate for the chromatic number; minimal number of colors needed to color each vertex such that no two adjacent vertices share the same color. The output is only an approximation since the actual calculation is NP-complete.

Inputs:

- A graph represented as a map from vertices (strings) to a list of neighbors (list of strings)
**OR**the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)