Color a WCDS graph (4 colors).
[Go] = NL_G_WCDSColor(G,N,C)
Graph.
List of master nodes (nucleus).
List of channels (nucleus).
Output graph.
NL_G_WCDSColor colors the WCDS graph G in order to reduce interferences (WIKIPEDIA). A color is assigned to each master node, so that 2 neighbor nodes will have a different channel. N represents the list of WCDS master nodes. The list of colors attributed by the 4-color theorem to each master node is stored in C (WIKIPEDIA). The output graph is stored in .