disjoint smart graphs

Author: rashtao

src/main/java/com/arangodb/entity/GraphEntity.java

@@ -36,6 +36,7 @@ public class GraphEntity implements Entity {
     private Collection<EdgeDefinition> edgeDefinitions;
     private Collection<String> orphanCollections;
     private Boolean isSmart;
+    private Boolean isDisjoint;
     private Integer numberOfShards;
     private String smartGraphAttribute;
     private ReplicationFactor replicationFactor;
@@ -57,6 +58,10 @@ public Boolean getIsSmart() {
         return isSmart;
     }
 
+    public Boolean getIsDisjoint() {
+        return isDisjoint;
+    }
+
     public Integer getNumberOfShards() {
         return numberOfShards;
     }

src/main/java/com/arangodb/model/GraphCreateOptions.java

@@ -94,6 +94,15 @@ public GraphCreateOptions isSmart(final Boolean isSmart) {
         return this;
     }
 
+    public Boolean getIsDisjoint() {
+        return getOptions().getIsDisjoint();
+    }
+
+    public GraphCreateOptions isDisjoint(final Boolean isDisjoint) {
+        getOptions().setIsDisjoint(isDisjoint);
+        return this;
+    }
+
     public Integer getReplicationFactor() {
         return getOptions().replicationFactor.getReplicationFactor();
     }
@@ -187,6 +196,7 @@ public static class SmartOptions {
         private Integer minReplicationFactor;
         private Integer numberOfShards;
         private String smartGraphAttribute;
+        private Boolean isDisjoint;
 
         public SmartOptions() {
             super();
@@ -233,6 +243,14 @@ public void setSmartGraphAttribute(final String smartGraphAttribute) {
             this.smartGraphAttribute = smartGraphAttribute;
         }
 
+        public Boolean getIsDisjoint() {
+            return isDisjoint;
+        }
+
+        public void setIsDisjoint(final Boolean isDisjoint) {
+            this.isDisjoint = isDisjoint;
+        }
+
     }
 
 }

src/test/java/com/arangodb/ArangoGraphTest.java

@@ -24,7 +24,8 @@
 import com.arangodb.entity.EdgeDefinition;
 import com.arangodb.entity.GraphEntity;
 import com.arangodb.model.GraphCreateOptions;
-import org.junit.*;
+import org.junit.BeforeClass;
+import org.junit.Test;
 import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
@@ -33,7 +34,6 @@
 import static org.hamcrest.CoreMatchers.notNullValue;
 import static org.hamcrest.MatcherAssert.assertThat;
 import static org.hamcrest.Matchers.*;
-
 import static org.junit.Assume.assumeTrue;
 
 /**
@@ -277,6 +277,26 @@ public void smartGraph() {
         assertThat(g.getNumberOfShards(), is(2));
     }
 
+    @Test
+    public void disjointSmartGraph() {
+        assumeTrue(isEnterprise());
+        assumeTrue(isCluster());
+        assumeTrue((isAtLeastVersion(3, 7)));
+
+        final Collection<EdgeDefinition> edgeDefinitions = new ArrayList<>();
+        edgeDefinitions.add(new EdgeDefinition().collection("smartGraph-edge-" + rnd()).from("smartGraph-vertex-" + rnd()).to("smartGraph-vertex-" + rnd()));
+
+        String graphId = GRAPH_NAME + rnd();
+        final GraphEntity g = db.createGraph(graphId, edgeDefinitions, new GraphCreateOptions()
+                .isSmart(true).isDisjoint(true).smartGraphAttribute("test").numberOfShards(2));
+
+        assertThat(g, is(notNullValue()));
+        assertThat(g.getIsSmart(), is(true));
+        assertThat(g.getIsDisjoint(), is(true));
+        assertThat(g.getSmartGraphAttribute(), is("test"));
+        assertThat(g.getNumberOfShards(), is(2));
+    }
+
     @Test
     public void drop() {
         final String edgeCollection = "edge_" + rnd();