JaCoP / GraphColoring / 0.1.0

This is an algorithm for graph coloring (http://en.wikipedia.org/wiki/Graph_coloring) built on the JaCoP Constraint Programming Solver (https://github.com/radsz/jacop). It takes a hash table, with each node name a key having the list of neighbors of that node as the corresponding value (essentially an adjacency list) and outputs a hash table of node names with the corresponding (integer) color as value.