Reduce the number of problems in aai-common by removing unused imports

[aai/aai-common.git] / aai-core / src / test / java / org / onap / aai / serialization / tinkerpop / TreeBackedVertexTest.java

diff --git a/aai-core/src/test/java/org/onap/aai/serialization/tinkerpop/TreeBackedVertexTest.java b/aai-core/src/test/java/org/onap/aai/serialization/tinkerpop/TreeBackedVertexTest.java
index c509ab4..b8c3ea9 100644 (file)
--- a/aai-core/src/test/java/org/onap/aai/serialization/tinkerpop/TreeBackedVertexTest.java
+++ b/aai-core/src/test/java/org/onap/aai/serialization/tinkerpop/TreeBackedVertexTest.java
@@ -48,27 +48,21 @@ public class TreeBackedVertexTest {
     public void configure() {
         GraphTraversalSource g = graph.traversal();
 
-        startKey = g.addV("vserver").as("v1").property("test", "hello")
-                    .addV("vserver").as("v2")
-                    .addV("interface").property("name", "interface 1").as("v10")
-                    .addE("hasChild").from("v2").property(EdgeProperty.CONTAINS.toString(), true)
-                    .addV("pserver").property("name", "pserver 1").as("v4")
-                    .addE("runsOn").to("v1").property(EdgeProperty.CONTAINS.toString(), false)
-                    .addV("interface").property("name", "interface 2").as("v3")
-                    .addE("hasChild").from("v1").property(EdgeProperty.CONTAINS.toString(), true)
-                    .addV("address").property("name", "address 1")
-                    .addE("hasChild").from("v3").property(EdgeProperty.CONTAINS.toString(), true)
-                    .addV("address").property("name", "address 2")
-                    .addE("hasChild").from("v3").property(EdgeProperty.CONTAINS.toString(), true)
-                    .addV("complex").property("name", "complex 1")
-                    .addE("locatedIn").from("v4").property(EdgeProperty.CONTAINS.toString(), false)
-                    .addV("interface").property("name", "interface 3")
-                    .addE("hasChild").from("v4").property(EdgeProperty.CONTAINS.toString(), true)
-                    .addV("subnet").property("name", "subnet 1").as("v5")
-                    .addE("in").from("v3").property(EdgeProperty.CONTAINS.toString(), false)
-                    .addV("address").property("name", "address 3").as("v6")
-                    .addE("hasChild").from("v5").property(EdgeProperty.CONTAINS.toString(), true)
-                    .select("v1").next();
+        startKey = g.addV("vserver").as("v1").property("test", "hello").addV("vserver").as("v2").addV("interface")
+                .property("name", "interface 1").as("v10").addE("hasChild").from("v2")
+                .property(EdgeProperty.CONTAINS.toString(), true).addV("pserver").property("name", "pserver 1").as("v4")
+                .addE("runsOn").to("v1").property(EdgeProperty.CONTAINS.toString(), false).addV("interface")
+                .property("name", "interface 2").as("v3").addE("hasChild").from("v1")
+                .property(EdgeProperty.CONTAINS.toString(), true).addV("address").property("name", "address 1")
+                .addE("hasChild").from("v3").property(EdgeProperty.CONTAINS.toString(), true).addV("address")
+                .property("name", "address 2").addE("hasChild").from("v3")
+                .property(EdgeProperty.CONTAINS.toString(), true).addV("complex").property("name", "complex 1")
+                .addE("locatedIn").from("v4").property(EdgeProperty.CONTAINS.toString(), false).addV("interface")
+                .property("name", "interface 3").addE("hasChild").from("v4")
+                .property(EdgeProperty.CONTAINS.toString(), true).addV("subnet").property("name", "subnet 1").as("v5")
+                .addE("in").from("v3").property(EdgeProperty.CONTAINS.toString(), false).addV("address")
+                .property("name", "address 3").as("v6").addE("hasChild").from("v5")
+                .property(EdgeProperty.CONTAINS.toString(), true).select("v1").next();
 
         tree = new GraphTraversalQueryEngine(g).findSubGraph((Vertex) startKey);
         treeDepth1 = new GraphTraversalQueryEngine(g).findSubGraph((Vertex) startKey, 1, false);