]> gerrit.simantics Code Review - simantics/platform.git/blobdiff - bundles/org.simantics.graphviz/examples/org/simantics/graphviz/examples/SimpleExample2.java
Migrated source code from Simantics SVN
[simantics/platform.git] / bundles / org.simantics.graphviz / examples / org / simantics / graphviz / examples / SimpleExample2.java
diff --git a/bundles/org.simantics.graphviz/examples/org/simantics/graphviz/examples/SimpleExample2.java b/bundles/org.simantics.graphviz/examples/org/simantics/graphviz/examples/SimpleExample2.java
new file mode 100644 (file)
index 0000000..9a72e27
--- /dev/null
@@ -0,0 +1,40 @@
+/*******************************************************************************\r
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management\r
+ * in Industry THTH ry.\r
+ * All rights reserved. This program and the accompanying materials\r
+ * are made available under the terms of the Eclipse Public License v1.0\r
+ * which accompanies this distribution, and is available at\r
+ * http://www.eclipse.org/legal/epl-v10.html\r
+ *\r
+ * Contributors:\r
+ *     VTT Technical Research Centre of Finland - initial API and implementation\r
+ *******************************************************************************/\r
+package org.simantics.graphviz.examples;\r
+\r
+import org.simantics.graphviz.Edge;\r
+import org.simantics.graphviz.Graph;\r
+import org.simantics.graphviz.Graphs;\r
+import org.simantics.graphviz.Node;\r
+\r
+public class SimpleExample2 {\r
+\r
+       public static final int COUNT = 1000;\r
+       \r
+       public static void main(String[] args) {\r
+               Graph graph = new Graph();\r
+               \r
+               Node[] nodes = new Node[COUNT];\r
+               \r
+               for(int i=1;i<COUNT;++i)\r
+                       nodes[i] = new Node(graph, Integer.toString(i));\r
+               \r
+               for(int i=2;i<COUNT;++i) {\r
+                       int j = (i%2) == 1 ? i*3 + 1 : i/2;\r
+                       if(j < COUNT)\r
+                               new Edge(graph, nodes[i], nodes[j]);\r
+               }\r
+               \r
+               Graphs.show(graph, "neato");\r
+       }\r
+       \r
+}\r