added implementation of get_all_cliques together with helper method greater_neighbors
added implementation of get_all_cliques together with helper method greater_neighbors
move helper function into get_all_cliques
format docstring
change output format of discovered cliques
do not place every node in a tuble
start clique testing
resolve merge conflict
first go at implementing the greedy coloring first fit algorithm with maximum degree ordering
trying to isolate reusable parts of code, needs to look into generators
trying to isolate reusable parts of code, needs to look into generators
trying to isolate reusable parts of code, needs to look into generators
trying to isolate reusable parts of code, needs to look into generators
Implementation of GIS (greedy independent set, changed min- and max-degree to use generators
Merge branch 'greedy-coloring-max-degree-first' of github.com:itu-sass-s2014/networkx into greedy-coloring-max-degree-first
Slight code cleanup, and added the CS coloring method
rewrote lf and sf to be simpler, added rs
unit tests for lf and sl
fixed slightly hard to color tests
keeping score