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. 5. The method of claim 3 where each edge of the graph corresponds to at least one switch between two of the various windows.