Package de.schauderhaft.degraph.model

Examples of de.schauderhaft.degraph.model.SimpleNode

25
26
27
28
29
30
31
32
    this.typ = typ;
    return this;
  }

  public Node createSimpleNode() {
    Node simpleNode = new SimpleNode(typ, name);
    return simpleNode;
  }
View Full Code Here
6
7
8
9
10
11
12
import de.schauderhaft.degraph.model.Node;
import de.schauderhaft.degraph.model.SimpleNode;

public class ChessCategory implements Categorizer {
  public SimpleNode asNode(String s) {
    return new SimpleNode("chesspiece", s);
  }
View Full Code Here
10
11
12
13
14
15
16
import de.schauderhaft.degraph.model.SimpleNode;

public class JavaApiTest {
  private SimpleNode node(String s) {
    return new SimpleNode(s, s);
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
  }

  @Test
  public void aGraphContainsTheNodesThatGetAddedToTheGraph() {
    JavaGraph graph = new JavaGraph();
    SimpleNode node = new SimpleNode("", "");
    graph.add(node);
    assertTrue(graph.topNodes().contains(node));
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
  }

  @Test
  public void simpleNodesDontHaveConnections() {
    JavaGraph graph = new JavaGraph();
    SimpleNode node = new SimpleNode("", "");
    graph.add(node);

    assertEquals(new HashSet<>(), graph.connectionsOf(node));

  }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
  }

  @Test
  public void connectionsOfANodeAreTheNodesItHasEdgesWith() {
    JavaGraph graph = new JavaGraph();
    SimpleNode a = node("a");
    SimpleNode b = node("b");
    graph.connect(a, b);

    assertEquals(new HashSet<>(asList(b)), graph.connectionsOf(a));
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
  }

  @Test
  public void aSimpleNodeHasNoContenten() {
    JavaGraph graph = new JavaGraph();
    SimpleNode node = new SimpleNode("", "");
    graph.add(node);
    assertEquals(new HashSet<>(), graph.contentsOf(node));
  }
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
    assertEquals(new HashSet<>(), graph.contentsOf(node));
  }

  @Test
  public void categorizerGetsApplied() {
    JavaGraph graph = new JavaGraph(new ConstantCategorizer(new SimpleNode(
        "x", "x")));
    SimpleNode node = new SimpleNode("", "");
    graph.add(node);
    assertEquals(new HashSet<>(asList(node)),
        graph.contentsOf(new SimpleNode("x", "x")));
  }
View Full Code Here
TOP

Related Classes of de.schauderhaft.degraph.model.SimpleNode

  • de.schauderhaft.degraph.java.ChessCategory
  • de.schauderhaft.degraph.java.JavaApiTest
  • de.schauderhaft.degraph.java.NodeBuilder
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.