Package com.tinkerpop.blueprints.impls.tg

Examples of com.tinkerpop.blueprints.impls.tg.TinkerGraph.addVertex()

64
65
66
67
68
69
70
71
72
73
74
  }

  @Test
  public void should_extract_single_element() {
    TinkerGraph graph = new TinkerGraph();
    Vertex a = graph.addVertex(null);

    Vertex single = GraphUtil.single(graph.getVertices());
    assertThat(single).isSameAs(a);
  }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
    public void should_fail_to_extract_single_element() {
      thrown.expect(MultipleElementsException.class);
      thrown.expectMessage("More than one element");

      TinkerGraph graph = new TinkerGraph();
      graph.addVertex(null);
      graph.addVertex(null);
      graph.addVertex(null);

      GraphUtil.single(graph.getVertices());
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
      thrown.expect(MultipleElementsException.class);
      thrown.expectMessage("More than one element");

      TinkerGraph graph = new TinkerGraph();
      graph.addVertex(null);
      graph.addVertex(null);
      graph.addVertex(null);

      GraphUtil.single(graph.getVertices());
    }
}
View Full Code Here
85
86
87
88
89
90
91
92
93
94
      thrown.expectMessage("More than one element");

      TinkerGraph graph = new TinkerGraph();
      graph.addVertex(null);
      graph.addVertex(null);
      graph.addVertex(null);

      GraphUtil.single(graph.getVertices());
    }
}
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
    }

    private void distributionGeneratorTest(Distribution indist, Distribution outdist) {
        int numNodes = 100;
        TinkerGraph graph = new TinkerGraph();
        for (int i=0;i<numNodes;i++) graph.addVertex(i);

        DistributionGenerator generator = new DistributionGenerator("knows");
        generator.setOutDistribution(indist);
        if (outdist!=null) generator.setOutDistribution(outdist);
        int numEdges = generator.generate(graph,numNodes*10);
 
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143

    private void communityGeneratorTest(Distribution community, Distribution degree, double crossPercentage) {
        int numNodes = 100;
        TinkerGraph graph = new TinkerGraph();
        for (int i=0;i<numNodes;i++) graph.addVertex(i);

        CommunityGenerator generator = new CommunityGenerator("knows");
        generator.setCommunityDistribution(community);
        generator.setDegreeDistribution(degree);
        generator.setCrossCommunityPercentage(crossPercentage);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.