strategy_independent_set(G, colors)
This function updates colors
in-place and return None
, unlike the other strategy functions in this module.
This algorithm repeatedly finds and removes a maximal independent set, assigning each node in the set an unused color.
G
is a NetworkX graph.
This strategy is related to strategy_smallest_last
: in that strategy, an independent set of size one is chosen at each step instead of a maximal independent set.
Uses a greedy independent set removal strategy to determine the colors.
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