Java GreedyGraphColoring类代码示例

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testGreedy() {
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  graph.createNode("A");
  graph.createNode("B");
  graph.createNode("C");
  graph.createNode("D");
  graph.connect("A", "--", "C");
  graph.connect("B", "--", "C");
  graph.connect("B", "--", "D");
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(2, coloring.color());
  validateColoring(graph);
  assertEquals("A", coloring.getPartitionSuperNode("A"));
  assertEquals("A", coloring.getPartitionSuperNode("B"));
  assertEquals("C", coloring.getPartitionSuperNode("C"));
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testFullyConnected() {
  final int count = 100;
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    for (int j = 0; j < count; j++) {
      graph.createNode("Node " + j);
      if (i != j) {
        graph.connect("Node " + i, null, "Node " + j);
      }
    }
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(count, coloring.color());
  validateColoring(graph);
  for (int i = 0; i < count; i++) {
    assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
  final int count = 10;
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  graph.createNode("Center");
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    graph.connect("Center", null, "Node " + i);
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(2, coloring.color());
  validateColoring(graph);
  assertEquals("Center", coloring.getPartitionSuperNode("Center"));
  for (int i = 0; i < count; i++) {
    assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testGreedy() {
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  graph.createNode("A");
  graph.createNode("B");
  graph.createNode("C");
  graph.createNode("D");
  graph.connect("A", "--", "C");
  graph.connect("B", "--", "C");
  graph.connect("B", "--", "D");
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(2, coloring.color());
  validateColoring(graph);
  assertEquals("A", coloring.getPartitionSuperNode("A"));
  assertEquals("A", coloring.getPartitionSuperNode("B"));
  assertEquals("C", coloring.getPartitionSuperNode("C"));
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testFullyConnected() {
  final int count = 100;
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    for (int j = 0; j < count; j++) {
      graph.createNode("Node " + j);
      if (i != j) {
        graph.connect("Node " + i, null, "Node " + j);
      }
    }
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(count, coloring.color());
  validateColoring(graph);
  for (int i = 0; i < count; i++) {
    assertEquals("Node " + i, coloring.getPartitionSuperNode("Node " + i));
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
  final int count = 10;
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  graph.createNode("Center");
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    graph.connect("Center", null, "Node " + i);
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(2, coloring.color());
  validateColoring(graph);
  assertEquals("Center", coloring.getPartitionSuperNode("Center"));
  for (int i = 0; i < count; i++) {
    assertEquals("Node 0", coloring.getPartitionSuperNode("Node " + i));
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testGreedy() {
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  graph.createNode("A");
  graph.createNode("B");
  graph.createNode("C");
  graph.createNode("D");
  graph.connect("A", "--", "C");
  graph.connect("B", "--", "C");
  graph.connect("B", "--", "D");
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<>(graph);
  assertThat(coloring.color()).isEqualTo(2);
  validateColoring(graph);
  assertThat(coloring.getPartitionSuperNode("A")).isEqualTo("A");
  assertThat(coloring.getPartitionSuperNode("B")).isEqualTo("A");
  assertThat(coloring.getPartitionSuperNode("C")).isEqualTo("C");
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testFullyConnected() {
  final int count = 100;
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    for (int j = 0; j < count; j++) {
      graph.createNode("Node " + j);
      if (i != j) {
        graph.connect("Node " + i, null, "Node " + j);
      }
    }
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<>(graph);
  assertThat(coloring.color()).isEqualTo(count);
  validateColoring(graph);
  for (int i = 0; i < count; i++) {
    assertThat(coloring.getPartitionSuperNode("Node " + i)).isEqualTo("Node " + i);
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testAllConnectedToOneNode() {
  final int count = 10;
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  graph.createNode("Center");
  for (int i = 0; i < count; i++) {
    graph.createNode("Node " + i);
    graph.connect("Center", null, "Node " + i);
  }
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<>(graph);
  assertThat(coloring.color()).isEqualTo(2);
  validateColoring(graph);
  assertThat(coloring.getPartitionSuperNode("Center")).isEqualTo("Center");
  for (int i = 0; i < count; i++) {
    assertThat(coloring.getPartitionSuperNode("Node " + i)).isEqualTo("Node 0");
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  // TODO(user): We CAN do this in the global scope, just need to be
  // careful when something is exported. Liveness uses bit-vector for live
  // sets so I don't see compilation time will be a problem for running this
  // pass in the global scope.
  Scope scope = t.getScope();
  if (scope.isGlobal()) {
    return;
  }
  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();

  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testNoEdge() {
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  for (int i = 0; i < 5; i++) {
    graph.createNode("Node " + i);
    // All node with same color.
    GraphColoring<String, String> coloring =
        new GreedyGraphColoring<String, String>(graph);
    assertEquals(1, coloring.color());
    validateColoring(graph);
    for (int j = 0; j < i; j++) {
      assertEquals("Node 0", coloring.getPartitionSuperNode("Node 0"));
    }
  }
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testTwoNodesConnected() {
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  graph.createNode("A");
  graph.createNode("B");
  graph.connect("A", "--", "B");
  GraphColoring<String, String> coloring =
      new GreedyGraphColoring<String, String>(graph);
  assertEquals(2, coloring.color());
  validateColoring(graph);
  assertEquals("A", coloring.getPartitionSuperNode("A"));
  assertEquals("B", coloring.getPartitionSuperNode("B"));
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
public void testTwoFullyConnected() {
  final int count = 100;
  // A graph with two disconnected disjunct cliques.
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  for (int i = 0; i < count; i++) {
    graph.createNode("Node Left " + i);
    graph.createNode("Node Right " + i);
    for (int j = 0; j < count; j++) {
      graph.createNode("Node Left " + j);
      graph.createNode("Node Right " + j);
      if (i != j) {
        graph.connect("Node Left " + i, null, "Node Left " + j);
        graph.connect("Node Right " + i, null, "Node Right " + j);
      }
    }
  }
  assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
  validateColoring(graph);

  // Connect the two cliques.
  for (int i = 0; i < count; i++) {
    graph.connect("Node Left " + i, null, "Node Right " + i);
  }
  // Think of two exactly same graph with the same coloring side by side.
  // If we circularly shift the colors of one of the graph by 1, we can
  // connect the isomorphic nodes and still have a valid coloring in the
  // resulting graph.
  assertEquals(count, new GreedyGraphColoring<String, String>(graph).color());
  validateColoring(graph);
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  // TODO(user): We CAN do this in the global scope, just need to be
  // careful when something is exported. Liveness uses bit-vector for live
  // sets so I don't see compilation time will be a problem for running this
  // pass in the global scope.
  if (t.inGlobalScope()) {
    return;
  }
  Scope scope = t.getScope();
  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();

  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  // If the function has exactly 2 params, mark them as escaped. This is
  // a work-around for an IE bug where it throws an exception if you
  // write to the parameters of the callback in a sort(). See:
  // http://code.google.com/p/closure-compiler/issues/detail?id=58
  if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
    liveness.markAllParametersEscaped();
  }
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}
 

import com.google.javascript.jscomp.graph.GraphColoring.GreedyGraphColoring; //导入依赖的package包/类
@Override
public void enterScope(NodeTraversal t) {
  Scope scope = t.getScope();
  if (!shouldOptimizeScope(scope)) {
    return;
  }

  ControlFlowGraph<Node> cfg = t.getControlFlowGraph();
  LiveVariablesAnalysis liveness =
      new LiveVariablesAnalysis(cfg, scope, compiler);
  // If the function has exactly 2 params, mark them as escaped. This is
  // a work-around for an IE bug where it throws an exception if you
  // write to the parameters of the callback in a sort(). See:
  // http://code.google.com/p/closure-compiler/issues/detail?id=58
  if (scope.getRootNode().getFirstChild().getNext().getChildCount() == 2) {
    liveness.markAllParametersEscaped();
  }
  liveness.analyze();

  UndiGraph<Var, Void> interferenceGraph =
      computeVariableNamesInterferenceGraph(
          t, cfg, liveness.getEscapedLocals());

  GraphColoring<Var, Void> coloring =
      new GreedyGraphColoring<Var, Void>(interferenceGraph,
          coloringTieBreaker);

  coloring.color();
  colorings.push(coloring);
}