• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号
登陆 注册

Java LinkedUndirectedGraph类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了Java中com.google.javascript.jscomp.graph.LinkedUndirectedGraph类的典型用法代码示例。如果您正苦于以下问题：Java LinkedUndirectedGraph类的具体用法？Java LinkedUndirectedGraph怎么用？Java LinkedUndirectedGraph使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



LinkedUndirectedGraph类属于com.google.javascript.jscomp.graph包，在下文中一共展示了LinkedUndirectedGraph类的19个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: testGreedy

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:18，代码来源:GraphColoringTest.java


示例2: testFullyConnected

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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));
  }
}
开发者ID:andyjko，项目名称:feedlack，代码行数:21，代码来源:GraphColoringTest.java


示例3: testAllConnectedToOneNode

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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));
  }
}
开发者ID:andyjko，项目名称:feedlack，代码行数:18，代码来源:GraphColoringTest.java


示例4: testUndirectedSimple

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testUndirectedSimple() {
  UndiGraph<String, String> graph =
      new LinkedUndirectedGraph<String, String>();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.connect("a", "--", "b");
  assertTrue(graph.hasNode("a"));
  assertTrue(graph.hasNode("b"));
  assertTrue(graph.hasNode("c"));
  assertFalse(graph.hasNode("d"));
  assertTrue(graph.isConnected("a", "b"));
  assertTrue(graph.isConnected("b", "a"));
  assertFalse(graph.isConnected("a", "c"));
  assertFalse(graph.isConnected("b", "c"));
  assertFalse(graph.isConnected("c", "a"));
  assertFalse(graph.isConnected("c", "b"));
  assertFalse(graph.isConnected("a", "a"));
  assertFalse(graph.isConnected("b", "b"));
  assertFalse(graph.isConnected("b", "c"));

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:27，代码来源:GraphTest.java


示例5: testUndirectedNeighbors

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testUndirectedNeighbors() {
  UndiGraph<String, String> graph =
      new LinkedUndirectedGraph<String, String>();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.createNode("d");
  graph.connect("a", "-", "b");
  graph.connect("a", "--", "b");
  graph.connect("a", "---", "b");
  graph.connect("a", "-", "c");
  graph.connect("c", "-", "d");
  assertSetEquals(graph.getNeighborNodes("a"), "b", "c");
  assertSetEquals(graph.getNeighborNodes("b"), "a");
  assertSetEquals(graph.getNeighborNodes("c"), "a", "d");
  assertListCount(graph.getNeighborNodes("a"), "b", 3);

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:22，代码来源:GraphTest.java


示例6: testSimpleSubGraph

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testSimpleSubGraph() {
  UndiGraph<String, String> graph =
      new LinkedUndirectedGraph<String, String>();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.connect("a", "--", "b");

  SubGraph<String, String> subGraph = graph.newSubGraph();
  subGraph.addNode("a");
  subGraph.addNode("b");

  try {
    subGraph.addNode("d");
    fail("SubGraph should not allow add for node that is not in graph.");
  } catch (IllegalArgumentException e) {
    // exception expected
  }

  assertFalse(subGraph.isIndependentOf("a"));
  assertFalse(subGraph.isIndependentOf("b"));
  assertTrue(subGraph.isIndependentOf("c"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:24，代码来源:GraphTest.java


示例7: RenameProperties

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
/**
 * Creates an instance.
 *
 * @param compiler The JSCompiler.
 * @param affinity Optimize for affinity information.
 * @param generatePseudoNames Generate pseudo names. e.g foo -> $foo$ instead
 *        of compact obfuscated names. This is used for debugging.
 * @param prevUsedPropertyMap The property renaming map used in a previous
 *        compilation.
 * @param reservedCharacters If specified these characters won't be used in
 *   generated names
 */
RenameProperties(AbstractCompiler compiler,
    boolean affinity,
    boolean generatePseudoNames,
    VariableMap prevUsedPropertyMap,
    @Nullable char[] reservedCharacters) {
  this.compiler = compiler;
  this.generatePseudoNames = generatePseudoNames;
  this.prevUsedPropertyMap = prevUsedPropertyMap;
  this.reservedCharacters = reservedCharacters;
  if (affinity) {
    this.affinityGraph = LinkedUndirectedGraph.createWithoutAnnotations();
  } else {
    this.affinityGraph = null;
  }
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:28，代码来源:RenameProperties.java


示例8: testGreedy

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:18，代码来源:GraphColoringTest.java


示例9: testFullyConnected

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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));
  }
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:21，代码来源:GraphColoringTest.java


示例10: testAllConnectedToOneNode

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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));
  }
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:18，代码来源:GraphColoringTest.java


示例11: testUndirectedSimple

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testUndirectedSimple() {
  UndiGraph<String, String> graph =
      LinkedUndirectedGraph.create();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.connect("a", "--", "b");
  assertTrue(graph.hasNode("a"));
  assertTrue(graph.hasNode("b"));
  assertTrue(graph.hasNode("c"));
  assertFalse(graph.hasNode("d"));
  assertTrue(graph.isConnected("a", "b"));
  assertTrue(graph.isConnected("b", "a"));
  assertFalse(graph.isConnected("a", "c"));
  assertFalse(graph.isConnected("b", "c"));
  assertFalse(graph.isConnected("c", "a"));
  assertFalse(graph.isConnected("c", "b"));
  assertFalse(graph.isConnected("a", "a"));
  assertFalse(graph.isConnected("b", "b"));
  assertFalse(graph.isConnected("b", "c"));

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:27，代码来源:GraphTest.java


示例12: testUndirectedNeighbors

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testUndirectedNeighbors() {
  UndiGraph<String, String> graph =
      LinkedUndirectedGraph.create();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.createNode("d");
  graph.connect("a", "-", "b");
  graph.connect("a", "--", "b");
  graph.connect("a", "---", "b");
  graph.connect("a", "-", "c");
  graph.connect("c", "-", "d");
  assertSetEquals(graph.getNeighborNodes("a"), "b", "c");
  assertSetEquals(graph.getNeighborNodes("b"), "a");
  assertSetEquals(graph.getNeighborNodes("c"), "a", "d");
  assertListCount(graph.getNeighborNodes("a"), "b", 3);

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:22，代码来源:GraphTest.java


示例13: testSimpleSubGraph

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testSimpleSubGraph() {
  UndiGraph<String, String> graph =
      LinkedUndirectedGraph.create();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.connect("a", "--", "b");

  SubGraph<String, String> subGraph = graph.newSubGraph();
  subGraph.addNode("a");
  subGraph.addNode("b");

  try {
    subGraph.addNode("d");
    fail("SubGraph should not allow add for node that is not in graph.");
  } catch (IllegalArgumentException e) {
    // exception expected
  }

  assertFalse(subGraph.isIndependentOf("a"));
  assertFalse(subGraph.isIndependentOf("b"));
  assertTrue(subGraph.isIndependentOf("c"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:24，代码来源:GraphTest.java


示例14: RenameProperties

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
/**
 * Creates an instance.
 *
 * @param compiler The JSCompiler.
 * @param affinity Optimize for affinity information.
 * @param generatePseudoNames Generate pseudo names. e.g foo -> $foo$ instead
 *        of compact obfuscated names. This is used for debugging.
 * @param prevUsedPropertyMap The property renaming map used in a previous
 *        compilation.
 * @param reservedCharacters If specified these characters won't be used in
 *   generated names
 */
RenameProperties(AbstractCompiler compiler,
    boolean affinity,
    boolean generatePseudoNames,
    VariableMap prevUsedPropertyMap,
    @Nullable char[] reservedCharacters) {
  this.compiler = compiler;
  this.generatePseudoNames = generatePseudoNames;
  this.prevUsedPropertyMap = prevUsedPropertyMap;
  this.reservedCharacters = reservedCharacters;
  if (affinity) {
    this.affinityGraph = LinkedUndirectedGraph.createWithoutAnnotations();
  } else {
    this.affinityGraph = null;
  }
  externedNames.addAll(compiler.getExternProperties());
}
开发者ID:nicks，项目名称:closure-compiler-old，代码行数:29，代码来源:RenameProperties.java


示例15: testNoEdge

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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"));
    }
  }
}
开发者ID:andyjko，项目名称:feedlack，代码行数:15，代码来源:GraphColoringTest.java


示例16: testTwoNodesConnected

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:13，代码来源:GraphColoringTest.java


示例17: testTwoFullyConnected

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的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);
}
开发者ID:andyjko，项目名称:feedlack，代码行数:31，代码来源:GraphColoringTest.java


示例18: testUndirectedSelfLoop

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testUndirectedSelfLoop() {
  UndiGraph<String, String> graph =
      new LinkedUndirectedGraph<String, String>();
  graph.createNode("a");
  graph.createNode("b");
  graph.connect("a", "--", "a");
  assertTrue(graph.isConnected("a", "a"));
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));

  // Removal.
  graph.disconnect("a", "a");
  assertFalse(graph.isConnected("a", "a"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:15，代码来源:GraphTest.java


示例19: testEdgeAnnotations

import com.google.javascript.jscomp.graph.LinkedUndirectedGraph; //导入依赖的package包/类
public void testEdgeAnnotations() {
  Graph<String, String> graph = new LinkedUndirectedGraph<String, String>();
  graph.createNode("1");
  graph.createNode("2");
  graph.createNode("3");
  graph.connect("1", "a", "2");
  graph.connect("2", "b", "3");
  GraphEdge<String, String> a = graph.getEdges("1", "2").get(0);
  GraphEdge<String, String> b = graph.getEdges("2", "3").get(0);
  checkAnnotations(graph, a, b);
}
开发者ID:andyjko，项目名称:feedlack，代码行数:12，代码来源:GraphTest.java



注：本文中的com.google.javascript.jscomp.graph.LinkedUndirectedGraph类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花
握手
雷人
路过
鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
More+
上一篇：
Java AbstractAdaptor类代码示例发布时间：2022-05-23
下一篇：
Java Sequence类代码示例发布时间：2022-05-23
热门推荐
More+
热门话题
More+
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服（服务时间 9:00～18:00）

在线QQ客服
地址：深圳市南山区西丽大学城创智工业园
电邮：jeky_zhao#qq.com
移动电话：139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap