_greedy_coloring_with_interchange(G, nodes)
This procedure is an adaption of the algorithm described by , and is an implementation of coloring with interchange. Please be advised, that the datastructures used are rather complex because they are optimized to minimize the time spent identifying subcomponents of the graph, which are possible candidates for color interchange.
A dictionary keyed by node to a color value
Return a coloring for :None:None:`orginal_graph` using interchange approach
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them