Visualize local codes

Author: 64json

src/main/java/org/algorithm_visualizer/Tracer.java

@@ -2,9 +2,15 @@
 
 import com.google.gson.Gson;
 
+import java.awt.*;
+import java.io.BufferedReader;
+import java.io.DataOutputStream;
 import java.io.FileWriter;
-import java.io.IOException;
+import java.io.InputStreamReader;
 import java.io.PrintWriter;
+import java.net.HttpURLConnection;
+import java.net.URL;
+import java.net.URLEncoder;
 import java.util.ArrayList;
 
 public abstract class Tracer {
@@ -55,11 +61,33 @@ protected Tracer(String title) {
     static {
         Runtime.getRuntime().addShutdownHook(new Thread(() -> {
             try {
-                FileWriter fileWriter = new FileWriter("traces.json");
-                PrintWriter printWriter = new PrintWriter(fileWriter);
-                printWriter.print(gson.toJson(traces));
-                printWriter.close();
-            } catch (IOException e) {
+                String content = gson.toJson(traces);
+                if (System.getenv("ALGORITHM_VISUALIZER") == null) {
+                    URL postUrl = new URL("https://algorithm-visualizer.org/api/visualizations");
+                    String params = "content=" + URLEncoder.encode(content, "UTF-8");
+
+                    HttpURLConnection conn = (HttpURLConnection) postUrl.openConnection();
+                    conn.setRequestMethod("POST");
+                    conn.setRequestProperty("Content-Type", "application/x-www-form-urlencoded");
+                    conn.setRequestProperty("Content-Length", Integer.toString(params.getBytes().length));
+                    conn.setDoOutput(true);
+
+                    DataOutputStream writer = new DataOutputStream(conn.getOutputStream());
+                    writer.writeBytes(params);
+                    writer.close();
+
+                    BufferedReader reader = new BufferedReader(new InputStreamReader(conn.getInputStream()));
+                    URL openUrl = new URL(reader.readLine());
+                    reader.close();
+
+                    Desktop.getDesktop().browse(openUrl.toURI());
+                } else {
+                    FileWriter fileWriter = new FileWriter("traces.json");
+                    PrintWriter printWriter = new PrintWriter(fileWriter);
+                    printWriter.print(content);
+                    printWriter.close();
+                }
+            } catch (Exception e) {
                 e.printStackTrace();
             }
         }));

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

@@ -0,0 +1,32 @@
+package org.algorithm_visualizer;
+
+class Test {
+    static GraphTracer tracer = new GraphTracer().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) {
+        tracer.set(G).layoutTree(0).delay();
+        DFS(0, -1);
+    }
+}