Allow method chaining only for property setters

Author: 64json

src/main/java/org/algorithm_visualizer/GraphTracer.java

@@ -25,6 +25,31 @@ public GraphTracer weighted() {
         return this;
     }
 
+    public GraphTracer layoutCircle() {
+        command("layoutCircle", new Object[]{});
+        return this;
+    }
+
+    public GraphTracer layoutTree(Object root, boolean sorted) {
+        command("layoutTree", new Object[]{root, sorted});
+        return this;
+    }
+
+    public GraphTracer layoutTree(Object root) {
+        command("layoutTree", new Object[]{root});
+        return this;
+    }
+
+    public GraphTracer layoutTree() {
+        command("layoutTree", new Object[]{});
+        return this;
+    }
+
+    public GraphTracer layoutRandom() {
+        command("layoutRandom", new Object[]{});
+        return this;
+    }
+
     public void addNode(Object id, double weight, double x, double y, int visitedCount, int selectedCount) {
         command("addNode", new Object[]{id, weight, x, y, visitedCount, selectedCount});
     }
@@ -113,26 +138,6 @@ public void removeEdge(Object source, Object target) {
         command("removeEdge", new Object[]{source, target});
     }
 
-    public void layoutCircle() {
-        command("layoutCircle", new Object[]{});
-    }
-
-    public void layoutTree(Object root, boolean sorted) {
-        command("layoutTree", new Object[]{root, sorted});
-    }
-
-    public void layoutTree(Object root) {
-        command("layoutTree", new Object[]{root});
-    }
-
-    public void layoutTree() {
-        command("layoutTree", new Object[]{});
-    }
-
-    public void layoutRandom() {
-        command("layoutRandom", new Object[]{});
-    }
-
     public void visit(Object target, Object source, double weight) {
         command("visit", new Object[]{target, source, weight});
     }

src/test/java/org/algorithm_visualizer/Test.java

@@ -1,9 +1,35 @@
 package org.algorithm_visualizer;
 
+import org.algorithm_visualizer.*;
+
 class Test {
+    static GraphTracer tracer = new GraphTracer();
+    tracer.log(new LogTracer());
+    static int G[][] = { // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
+            {0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+            {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    };
+
+    static void DFS(int node, int parent) { // node = current node, parent = previous node
+        tracer.visit(node, parent).delay();
+        for (int i = 0; i < G[node].length; i++) {
+            if (G[node][i] == 1) { // if current node has the i-th node as a child
+                DFS(i, node); // recursively call DFS
+            }
+        }
+    }
+
     public static void main(String[] args) {
-        ChartTracer chartTracer = new ChartTracer();
-        chartTracer.set(new Object[]{});
-        Layout.setRoot(new VerticalLayout(new Commander[]{chartTracer}));
+        tracer.set(G).layoutTree(0).delay();
+        DFS(0, -1);
     }
-}
+}