Package com.tinkerpop.blueprints

Examples of com.tinkerpop.blueprints.Graph

13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
public class EdgeHelperTest extends BaseTest {

    public void testRelabelEdge() {
        Graph graph = TinkerGraphFactory.createTinkerGraph();
        EdgeHelper.relabelEdge(graph, graph.getEdge(7), "1234", "use_to_know");
        assertEquals(count(graph.getVertices()), 6);
        assertEquals(count(graph.getEdges()), 6);
        int counter = 0;
        int counter2 = 0;
        Edge temp = null;
        for (Edge edge : graph.getVertex(1).getEdges(Direction.OUT)) {
            if (edge.getLabel().equals("use_to_know")) {
                counter++;
                assertEquals(edge.getId(), "1234");
                assertEquals(edge.getProperty("weight"), 0.5f);
                temp = edge;
            }

            counter2++;
        }
        assertEquals(counter, 1);
        assertEquals(counter2, 3);

        counter = 0;
        counter2 = 0;
        for (Edge edge : graph.getVertex(2).getEdges(Direction.IN)) {
            if (edge.getLabel().equals("use_to_know")) {
                counter++;
                assertEquals(edge.getId(), "1234");
                assertEquals(edge.getProperty("weight"), 0.5f);
                assertEquals(edge, temp);
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
        assertEquals(counter, 1);
        assertEquals(counter2, 1);
    }

    public void testRelabelEdges() {
        Graph graph = TinkerGraphFactory.createTinkerGraph();
        EdgeHelper.relabelEdges(graph, Arrays.asList(graph.getEdge(7)), "use_to_know");
        assertEquals(count(graph.getVertices()), 6);
        assertEquals(count(graph.getEdges()), 6);
        int counter = 0;
        int counter2 = 0;
        Edge temp = null;
        for (Edge edge : graph.getVertex(1).getEdges(Direction.OUT)) {
            if (edge.getLabel().equals("use_to_know")) {
                counter++;
                assertEquals(edge.getProperty("weight"), 0.5f);
                temp = edge;
            }

            counter2++;
        }
        assertEquals(counter, 1);
        assertEquals(counter2, 3);

        counter = 0;
        counter2 = 0;
        for (Edge edge : graph.getVertex(2).getEdges(Direction.IN)) {
            if (edge.getLabel().equals("use_to_know")) {
                counter++;
                assertEquals(edge.getProperty("weight"), 0.5f);
                assertEquals(edge, temp);
            }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
        assertEquals(counter, 1);
        assertEquals(counter2, 1);
    }

    public void testGetOther() {
        Graph graph = TinkerGraphFactory.createTinkerGraph();
        for (Vertex vertex : graph.getVertices()) {
            for (Edge edge : vertex.getEdges(Direction.BOTH)) {
                assertNotSame(vertex, EdgeHelper.getOther(edge, vertex));
            }
        }
    }
View Full Code Here
9
10
11
12
13
14
15
16
17
18
19
20
21
22
* @author Marko A. Rodriguez (http://markorodriguez.com)
*/
public class VertexHelperTest extends BaseTest {

    public void testEdgeSetEquality() {
        Graph graph = TinkerGraphFactory.createTinkerGraph();

        for (Vertex v : graph.getVertices()) {
            for (Vertex u : graph.getVertices()) {
                if (ElementHelper.areEqual(v, u)) {
                    assertTrue(VertexHelper.haveEqualEdges(v, u, true));
                    assertTrue(VertexHelper.haveEqualEdges(v, u, false));
                } else {
                    assertFalse(VertexHelper.haveEqualEdges(v, u, true));
View Full Code Here
27
28
29
30
31
32
33
34
35
36
37
38
39
40
        }

    }

    public void testNeighborhoodEquality() {
        Graph graph = TinkerGraphFactory.createTinkerGraph();

        for (Vertex v : graph.getVertices()) {
            for (Vertex u : graph.getVertices()) {
                if (ElementHelper.areEqual(v, u)) {
                    assertTrue(VertexHelper.haveEqualNeighborhood(v, u, true));
                    assertTrue(VertexHelper.haveEqualNeighborhood(v, u, false));
                } else {
                    assertFalse(VertexHelper.haveEqualNeighborhood(v, u, true));
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    private final URI markoKnowsVadas, markoKnowsJosh, markoCreatedLop, joshCreatedRipple, joshCreatedLop, peterCreatedLop;

    private SailConnection sc;

    public PropertyGraphSailTest() throws Exception {
        Graph g = new TinkerGraph();
        GraphMLReader r = new GraphMLReader(g);
        r.inputGraph(GraphMLReader.class.getResourceAsStream("graph-example-1.xml"));

        sail = new PropertyGraphSail(g);
        sail.initialize();
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
        Vertex v2 = g2.getVertex(1);
        assertEquals("\u00E9", v2.getProperty("text"));
    }

    public void testStreamStaysOpen() throws IOException {
        final Graph g = TinkerGraphFactory.createTinkerGraph();
        final PrintStream oldStream = System.out;
        final ByteArrayOutputStream outContent = new ByteArrayOutputStream();
        System.setOut(new PrintStream(outContent));

        final GraphMLWriter writer = new GraphMLWriter(g);
View Full Code Here
967
968
969
970
971
972
973
974
975
976
977
978
        Assert.assertFalse(json.has("alwaysNull"));
    }

    @Test
    public void jsonFromElementNullsNoKeysNoTypes() throws JSONException {
        Graph g = new TinkerGraph();
        Vertex v = g.addVertex(1);

        Map<String, Object> map = new HashMap<String, Object>();
        map.put("innerkey", null);

        List<String> innerList = new ArrayList<String>();
View Full Code Here
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
        Assert.assertEquals("string", jsonArray.get(1));
    }

    @Test
    public void jsonFromElementNullsNoKeysWithTypes() throws JSONException {
        Graph g = new TinkerGraph();
        Vertex v = g.addVertex(1);

        Map<String, Object> map = new HashMap<String, Object>();
        map.put("innerkey", null);

        List<String> innerList = new ArrayList<String>();
View Full Code Here
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
        Assert.assertEquals(GraphSONTokens.TYPE_UNKNOWN, jsonObjectListFirst.optString(GraphSONTokens.TYPE));
    }

    @Test
    public void vertexFromJsonValid() throws IOException, JSONException {
        Graph g = new TinkerGraph();
        ElementFactory factory = new GraphElementFactory(g);

        Vertex v = GraphSONUtility.vertexFromJson(new JSONObject(new JSONTokener(vertexJson1)), factory, GraphSONMode.NORMAL, null);

        Assert.assertSame(v, g.getVertex(1));

        // tinkergraph converts id to string
        Assert.assertEquals("1", v.getId());
        Assert.assertEquals("marko", v.getProperty("name"));
        Assert.assertEquals(29, v.getProperty("age"));
View Full Code Here
TOP

Related Classes of com.tinkerpop.blueprints.Graph

  • com.dooapp.gaedo.blueprints.BluePrintsPersister
  • com.dooapp.gaedo.blueprints.operations.Deleter
  • com.dooapp.gaedo.blueprints.operations.Updater
  • com.dooapp.gaedo.blueprints.queries.executable.VertexRootsCollector
  • com.thinkaurelius.faunus.formats.BlueprintsGraphOutputMapReduceTest
  • com.thinkaurelius.faunus.formats.rexster.FaunusRexsterInputFormatExtensionTest
  • com.thinkaurelius.faunus.formats.rexster.util.VertexToFaunusBinaryTest
  • com.thinkaurelius.titan.blueprints.BerkeleyJEBlueprintsTest
  • com.thinkaurelius.titan.blueprints.EmbeddedCassandraBlueprintsTest
  • com.thinkaurelius.titan.blueprints.InternalCassandraBlueprintsTest
    • 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.