Java Graph类代码示例

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› Java›Java编程经验

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

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

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

示例1: testGreedy

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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.Graph; //导入依赖的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.Graph; //导入依赖的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: testGreedy

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例5: testFullyConnected

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例6: testAllConnectedToOneNode

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例7: testNoEdge

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例8: testTwoNodesConnected

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例9: testTwoFullyConnected

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例10: validateColoring

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
/**
 * Validate that each node has been colored and connected nodes have different
 * coloring.
 */
private static <N, E> void validateColoring(Graph<N, E> graph) {
  for (GraphNode<N, E> node : graph.getNodes()) {
    assertTrue(node.getAnnotation() != null);
  }
  for (GraphEdge<N, E> edge : graph.getEdges()) {
    Color c1 = edge.getNodeA().getAnnotation();
    Color c2 = edge.getNodeB().getAnnotation();
    assertTrue(c1 != null);
    assertTrue(c2 != null);
    assertTrue(!c1.equals(c2));
  }
}

开发者ID:andyjko，项目名称:feedlack，代码行数:17，代码来源:GraphColoringTest.java

示例11: testEdgeAnnotations

import com.google.javascript.jscomp.graph.Graph; //导入依赖的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

示例12: testDirectedDegree

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testDirectedDegree(Graph<String, String> graph) {
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.createNode("d");
  assertEquals(0, graph.getNodeDegree("a"));
  graph.connect("a", "-", "b");
  assertEquals(1, graph.getNodeDegree("a"));
  graph.connect("b", "-", "c");
  assertEquals(1, graph.getNodeDegree("a"));
  graph.connect("a", "-", "c");
  assertEquals(2, graph.getNodeDegree("a"));
  graph.connect("d", "-", "a");
  assertEquals(3, graph.getNodeDegree("a"));
}

开发者ID:andyjko，项目名称:feedlack，代码行数:16，代码来源:GraphTest.java

示例13: testDirectedConnectIfNotFound

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testDirectedConnectIfNotFound(Graph<String, String> graph) {
  graph.createNode("a");
  graph.createNode("b");
  graph.connectIfNotFound("a", "-", "b");
  assertEquals(1, graph.getNodeDegree("a"));
  graph.connectIfNotFound("a", "-", "b");
  assertEquals(1, graph.getNodeDegree("a"));
  graph.connectIfNotFound("a", null, "b");
  assertEquals(2, graph.getNodeDegree("a"));
  graph.connectIfNotFound("a", null, "b");
  assertEquals(2, graph.getNodeDegree("a"));
}

开发者ID:andyjko，项目名称:feedlack，代码行数:13，代码来源:GraphTest.java

示例14: testNoEdge

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testNoEdge() {
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  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:SpoonLabs，项目名称:astor，代码行数:15，代码来源:GraphColoringTest.java

示例15: testTwoNodesConnected

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoNodesConnected() {
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  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:SpoonLabs，项目名称:astor，代码行数:13，代码来源:GraphColoringTest.java

示例16: testTwoFullyConnected

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testTwoFullyConnected() {
  final int count = 100;
  // A graph with two disconnected disjunct cliques.
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  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:SpoonLabs，项目名称:astor，代码行数:31，代码来源:GraphColoringTest.java

示例17: testEdgeAnnotations

import com.google.javascript.jscomp.graph.Graph; //导入依赖的package包/类
public void testEdgeAnnotations() {
  Graph<String, String> graph = LinkedUndirectedGraph.create();
  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:SpoonLabs，项目名称:astor，代码行数:12，代码来源:GraphTest.java

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

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

Java OAuthHelper类代码示例发布时间：2022-05-22

Java ObjectIdP类代码示例发布时间：2022-05-22

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：18273|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9677|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8179|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8549|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8457|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9393|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8430|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7865|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8415|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7394|2022-11-06

客服电话

电子邮件

Java Graph类代码示例

示例1: testGreedy

示例2: testFullyConnected

示例3: testAllConnectedToOneNode

示例4: testGreedy

示例5: testFullyConnected

示例6: testAllConnectedToOneNode

示例7: testNoEdge

示例8: testTwoNodesConnected

示例9: testTwoFullyConnected

示例10: validateColoring

示例11: testEdgeAnnotations

示例12: testDirectedDegree

示例13: testDirectedConnectIfNotFound

示例14: testNoEdge

示例15: testTwoNodesConnected

示例16: testTwoFullyConnected

示例17: testEdgeAnnotations

请发表评论

全部评论

上一篇：

下一篇：

librespeed/speedtest: Self-hosted Speedt

avehtari/BDA_m_demos: Bayesian Data Anal

四维彩超怎么看性别？四维看男孩女孩诀窍

medfreeman/markdown-it-toc-and-anchor: m

Matlab如何循环读取文件

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053