当前位置: 首页>>代码示例>>Java>>正文

Java DiGraph.createNode方法代码示例

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


在下文中一共展示了DiGraph.createNode方法的7个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: testDirectedInAndOutEdges

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedInAndOutEdges() {
  DiGraph<String, String> graph =
      new LinkedDirectedGraph<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.getDirectedSuccNodes("a"), "b", "c");
  assertSetEquals(graph.getDirectedPredNodes("b"), "a");
  assertSetEquals(graph.getDirectedPredNodes("c"), "a");
  assertListCount(graph.getDirectedSuccNodes("a"), "b", 3);

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

示例2: testDirectedInAndOutEdges

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedInAndOutEdges() {
  DiGraph<String, String> graph =
      LinkedDirectedGraph.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.getDirectedSuccNodes("a"), "b", "c");
  assertSetEquals(graph.getDirectedPredNodes("b"), "a");
  assertSetEquals(graph.getDirectedPredNodes("c"), "a");
  assertListCount(graph.getDirectedSuccNodes("a"), "b", 3);

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

示例3: testDirectedSelfLoop

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedSelfLoop() {
  DiGraph<String, String> graph =
      new LinkedDirectedGraph<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"));
  assertTrue(graph.isConnectedInDirection("a", "a"));
  assertFalse(graph.isConnectedInDirection("a", "b"));
  assertFalse(graph.isConnectedInDirection("b", "a"));

  // Removal.
  graph.disconnect("a", "a");
  assertFalse(graph.isConnected("a", "a"));

  // Disconnect both ways.
  graph.connect("a", "->", "a");
  graph.disconnect("a", "a");
  assertFalse(graph.isConnected("a", "a"));
  assertFalse(graph.isConnected("a", "a"));

  // Disconnect one way.
  graph.connect("a", "->", "a");
  graph.disconnectInDirection("a", "a");
  assertFalse(graph.isConnected("a", "a"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:29，代码来源:GraphTest.java

示例4: testDirectedSelfLoop

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedSelfLoop() {
  DiGraph<String, String> graph =
      LinkedDirectedGraph.create();
  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"));
  assertTrue(graph.isConnectedInDirection("a", "a"));
  assertFalse(graph.isConnectedInDirection("a", "b"));
  assertFalse(graph.isConnectedInDirection("b", "a"));

  // Removal.
  graph.disconnect("a", "a");
  assertFalse(graph.isConnected("a", "a"));

  // Disconnect both ways.
  graph.connect("a", "->", "a");
  graph.disconnect("a", "a");
  assertFalse(graph.isConnected("a", "a"));
  assertFalse(graph.isConnected("a", "a"));

  // Disconnect one way.
  graph.connect("a", "->", "a");
  graph.disconnectInDirection("a", "a");
  assertFalse(graph.isConnected("a", "a"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:29，代码来源:GraphTest.java

示例5: testDirectedGetFirstEdge

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedGetFirstEdge() {
  DiGraph<String, String> graph =
    LinkedDirectedGraph.create();
  graph.createNode("a");
  graph.createNode("b");
  graph.createNode("c");
  graph.connect("a", "-", "b");
  assertEquals(graph.getFirstEdge("a", "b").getValue(), "-");
  assertEquals(graph.getFirstEdge("b", "a").getValue(), "-");
  assertNull(graph.getFirstEdge("a", "c"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:12，代码来源:GraphTest.java

示例6: testDirectedSimple

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedSimple() {
  DiGraph<String, String> graph =
      new LinkedDirectedGraph<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"));
  assertTrue(graph.isConnectedInDirection("a", "b"));
  assertFalse(graph.isConnectedInDirection("b", "a"));
  assertFalse(graph.isConnectedInDirection("a", "c"));
  assertFalse(graph.isConnectedInDirection("b", "c"));
  assertFalse(graph.isConnectedInDirection("c", "a"));
  assertFalse(graph.isConnectedInDirection("c", "b"));

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));

  // Disconnect both ways.
  graph.connect("a", "->", "b");
  graph.connect("b", "->", "a");
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));

  // Disconnect one way.
  graph.connect("a", "->", "b");
  graph.connect("b", "->", "a");
  graph.disconnectInDirection("a", "b");
  assertTrue(graph.isConnected("b", "a"));
  assertTrue(graph.isConnected("a", "b"));
  assertFalse(graph.isConnectedInDirection("a", "b"));
  assertTrue(graph.isConnectedInDirection("b", "a"));
}
开发者ID:andyjko，项目名称:feedlack，代码行数:49，代码来源:GraphTest.java

示例7: testDirectedSimple

import com.google.javascript.jscomp.graph.DiGraph; //导入方法依赖的package包/类
public void testDirectedSimple() {
  DiGraph<String, String> graph =
      LinkedDirectedGraph.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"));
  assertTrue(graph.isConnectedInDirection("a", "b"));
  assertFalse(graph.isConnectedInDirection("b", "a"));
  assertFalse(graph.isConnectedInDirection("a", "c"));
  assertFalse(graph.isConnectedInDirection("b", "c"));
  assertFalse(graph.isConnectedInDirection("c", "a"));
  assertFalse(graph.isConnectedInDirection("c", "b"));

  // Removal.
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));

  // Disconnect both ways.
  graph.connect("a", "->", "b");
  graph.connect("b", "->", "a");
  graph.disconnect("a", "b");
  assertFalse(graph.isConnected("a", "b"));
  assertFalse(graph.isConnected("b", "a"));

  // Disconnect one way.
  graph.connect("a", "->", "b");
  graph.connect("b", "->", "a");
  graph.disconnectInDirection("a", "b");
  assertTrue(graph.isConnected("b", "a"));
  assertTrue(graph.isConnected("a", "b"));
  assertFalse(graph.isConnectedInDirection("a", "b"));
  assertTrue(graph.isConnectedInDirection("b", "a"));
}
开发者ID:SpoonLabs，项目名称:astor，代码行数:49，代码来源:GraphTest.java


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