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
Added code and tests for the DSATUR algorithm
Merge branch 'greedy-coloring-max-degree-first' of github.com:itu-sass-s2014/networkx into greedy-coloring-max-degree-first
adding implementation of interchange
adding interchange functionality
Working version of interchange
GIS no longer uses greedy color. Interchange changed to support nodes that cais not indexed with numbers. Tests added for Interchange
remove maxdegree files
added and improved documentation