strategy_smallest_last(G, colors)
Specifically, the degrees of each node are tracked in a bucket queue. From this, the node of minimum degree is repeatedly popped from the graph, updating its neighbors' degrees.
G
is a NetworkX graph. colors
is ignored.
This implementation of the strategy runs in $O(n + m)$ time (ignoring polylogarithmic factors), where $n$ is the number of nodes and $m$ is the number of edges.
This strategy is related to strategy_independent_set
: if we interpret each node removed as an independent set of size one, then this strategy chooses an independent set of size one instead of a maximal independent set.
Returns a deque of the nodes of G
, "smallest" last.
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