X-Git-Url: http://wamblee.org/gitweb/?a=blobdiff_plain;f=system%2Fgeneral%2Fsrc%2Ftest%2Fjava%2Forg%2Fwamblee%2Fsystem%2Fgraph%2FGraphTest.java;h=fa93d003bca8af38c24d7e7140dcb716b5eca9e6;hb=8de36ff0206c996baf3ee4adc3e2293b12ff5f39;hp=ceae5819a992f9a95ba927a353f471345fce974c;hpb=89c06d4d52b46c154128c97d6e758fa1f4fc7a6e;p=utils

diff --git a/system/general/src/test/java/org/wamblee/system/graph/GraphTest.java b/system/general/src/test/java/org/wamblee/system/graph/GraphTest.java
index ceae5819..fa93d003 100644
--- a/system/general/src/test/java/org/wamblee/system/graph/GraphTest.java
+++ b/system/general/src/test/java/org/wamblee/system/graph/GraphTest.java
@@ -23,17 +23,12 @@ import org.wamblee.test.AssertionUtils;
 import java.util.Arrays;
 import java.util.List;
 
-
 /**
- * DOCUMENT ME!
- *
+ * 
  * @author $author$
  * @version $Revision$
-  */
+ */
 public class GraphTest extends TestCase {
-    /**
-     * DOCUMENT ME!
-     */
     public void testNodeMgt() {
         final Graph graph = new Graph();
         assertTrue(graph.getNodes().isEmpty());
@@ -48,7 +43,7 @@ public class GraphTest extends TestCase {
         assertTrue(graph.removeNode(x));
         assertTrue(graph.getNodes().isEmpty());
 
-        // Empty node set. 
+        // Empty node set.
         assertFalse(graph.removeNode(x));
 
         Node y = new DefaultNode("y");
@@ -57,20 +52,17 @@ public class GraphTest extends TestCase {
 
         // duplicate node
         AssertionUtils.assertException(new AssertionUtils.ErroneousCode() {
-                @Override
-                public void run() throws Exception {
-                    graph.addNode(new DefaultNode("x"));
-                }
-            }, IllegalArgumentException.class);
+            @Override
+            public void run() throws Exception {
+                graph.addNode(new DefaultNode("x"));
+            }
+        }, IllegalArgumentException.class);
     }
 
-    /**
-     * DOCUMENT ME!
-     */
     public void testEdgeMgt() {
         final Graph graph = new Graph();
-        final Node  x     = new DefaultNode("x");
-        final Node  y     = new DefaultNode("y");
+        final Node x = new DefaultNode("x");
+        final Node y = new DefaultNode("y");
         graph.addNode(x);
         graph.addNode(y);
 
@@ -80,30 +72,27 @@ public class GraphTest extends TestCase {
 
         // duplicate edge.
         AssertionUtils.assertException(new AssertionUtils.ErroneousCode() {
-                @Override
-                public void run() throws Exception {
-                    graph.addEdge(e);
-                }
-            }, IllegalArgumentException.class);
+            @Override
+            public void run() throws Exception {
+                graph.addEdge(e);
+            }
+        }, IllegalArgumentException.class);
 
         // Remove node when edge is still present
         AssertionUtils.assertException(new AssertionUtils.ErroneousCode() {
-                @Override
-                public void run() throws Exception {
-                    graph.removeNode(x);
-                }
-            }, IllegalArgumentException.class);
+            @Override
+            public void run() throws Exception {
+                graph.removeNode(x);
+            }
+        }, IllegalArgumentException.class);
 
         Node a = new DefaultNode("a");
         graph.addNode(a);
-        graph.addEdges(Arrays.asList(
-                new Edge[] { new DefaultEdge(x, a), new DefaultEdge(y, a) }));
+        graph.addEdges(Arrays.asList(new Edge[] { new DefaultEdge(x, a),
+            new DefaultEdge(y, a) }));
         assertEquals(3, graph.getEdges().size());
     }
 
-    /**
-     * DOCUMENT ME!
-     */
     public void testExtend() {
         Graph graph = new Graph();
         graph.addNode(new MyNode("x", new String[] { "a", "b" }));
@@ -115,42 +104,39 @@ public class GraphTest extends TestCase {
         assertEquals(12, edges.size()); // 2 outgoing and 2 incoming nodes.
     }
 
-    /**
-     * DOCUMENT ME!
-     */
     public void testApplyFilter() {
         Graph graph = new Graph();
         graph.addNode(new DefaultNode("x"));
         graph.addNode(new DefaultNode("y"));
         graph.addNode(new DefaultNode("z"));
-        graph.addEdge(new DefaultEdge(graph.findNode("x"), graph.findNode("y")));
-        graph.addEdge(new DefaultEdge(graph.findNode("y"), graph.findNode("z")));
-        graph.addEdge(new DefaultEdge(graph.findNode("z"), graph.findNode("x")));
+        graph
+            .addEdge(new DefaultEdge(graph.findNode("x"), graph.findNode("y")));
+        graph
+            .addEdge(new DefaultEdge(graph.findNode("y"), graph.findNode("z")));
+        graph
+            .addEdge(new DefaultEdge(graph.findNode("z"), graph.findNode("x")));
 
         assertEquals(3, graph.getEdges().size());
 
         graph.applyFilter(new EdgeFilter() {
-                @Override
-                public boolean isViolated(Edge aEdge) {
-                    if (aEdge.getFrom().getName().equals("x")) {
-                        return false;
-                    }
-
-                    return true;
+            @Override
+            public boolean isViolated(Edge aEdge) {
+                if (aEdge.getFrom().getName().equals("x")) {
+                    return false;
                 }
-            });
+
+                return true;
+            }
+        });
 
         assertEquals(1, graph.getEdges().size());
         assertEquals("x", graph.getEdges().get(0).getFrom().getName());
     }
 
-    /**
-     * DOCUMENT ME!
-     */
     public void testFindIncomingOutgoing() {
         Graph graph = new Graph();
-        Node  x     = new DefaultNode("x");
-        Node  y     = new DefaultNode("y");
+        Node x = new DefaultNode("x");
+        Node y = new DefaultNode("y");
         graph.addNode(x);
         graph.addNode(y);
 
@@ -172,14 +158,11 @@ public class GraphTest extends TestCase {
         assertTrue(outgoing.isEmpty());
     }
 
-    /**
-     * DOCUMENT ME!
-     */
     public void testAccept() {
         Graph graph = new Graph();
-        Node  x     = new DefaultNode("x");
-        Node  y     = new DefaultNode("y");
-        Edge  e     = new DefaultEdge(x, y);
+        Node x = new DefaultNode("x");
+        Node y = new DefaultNode("y");
+        Edge e = new DefaultEdge(x, y);
         graph.addNode(x);
         graph.addNode(y);
         graph.addEdge(e);