3. The method of claim 1 where the switching relationships are represented by a graph comprising nodes, edges, and weights.
3. The method of claim 1 where the switching relationships are represented by a graph comprising nodes, edges, and weights. 4. The method of claim 3 where each node in the graph represents one of the plurality of windows.