From 3b99557c0c2aba2ec3122797e6cfe9cd4a960471 Mon Sep 17 00:00:00 2001
From: Jochen Keil <jochen.keil@gmail.com>
Date: Sun, 30 May 2010 22:25:13 +0200
Subject: [PATCH] add testcase for ListGraph; move cases to static methods; add
 some verbosity

---
 GraphTest.java | 68 +++++++++++++++++++++++++++++++++++++++++++++++++++-------
 1 file changed, 60 insertions(+), 8 deletions(-)

diff --git a/GraphTest.java b/GraphTest.java
index 97c485b..4a1ed5f 100644
--- a/GraphTest.java
+++ b/GraphTest.java
@@ -4,8 +4,7 @@ import si.ant.graph.*;
 
 public class GraphTest {
 
-  public static void main(String[] args) {
-
+  public static void MatrixGraphTest() {
     int n = 5;
     int[][] graph = new int[n][n];
     for (int i = 0; i < n; i++) {
@@ -27,23 +26,76 @@ public class GraphTest {
     Iterator<MatrixNode> nodesit = nodes.iterator();
     Iterator<MatrixEdge> edgesit = edges.iterator();
 
+    System.out.println("Nodes: ");
     while (nodesit.hasNext())
       System.out.println(nodesit.next().toString());
 
+    System.out.println("Edges: ");
     while (edgesit.hasNext())
       System.out.println(edgesit.next().toString());
 
-    System.out.println(nodes.get(2).getIndex());
-    System.out.println(nodes.get(2).isEqual(nodes.get(2)));
-    System.out.println(nodes.get(2).isEqual(nodes.get(3)));
-    System.out.println(edges.get(2).getDistance());
-    System.out.println(edges.get(2).isEqual(edges.get(2)));
-    System.out.println(edges.get(2).isEqual(edges.get(3)));
+    System.out.println("nodes.get(2).getIndex(): " + nodes.get(2).getIndex());
+    System.out.println("true: " + nodes.get(2).isEqual(nodes.get(2)));
+    System.out.println("false: " + nodes.get(2).isEqual(nodes.get(3)));
+    System.out.println("3.0: " + edges.get(2).getDistance());
+    System.out.println("true: " + edges.get(2).isEqual(edges.get(2)));
+    System.out.println("false: " + edges.get(2).isEqual(edges.get(3)));
 
+    System.out.println("neighbours of " + nodes.get(3) + ":");
     Vector<MatrixNode> neighbours = mg.getNeighbours(nodes.get(3));
     Iterator<MatrixNode> neighboursit = neighbours.iterator();
 
     while (neighboursit.hasNext())
       System.out.println(neighboursit.next().toString());
   }
+
+  public static void ListGraphTest() {
+    Vector<ListEdge> edgegraph = new Vector<ListEdge>(4);
+    ListNode node0 = new ListNode("nil");
+    ListNode node1 = new ListNode("one");
+    ListNode node2 = new ListNode("two");
+    ListNode node3 = new ListNode("three");
+    ListNode node4 = new ListNode("four");
+    edgegraph.add(new ListEdge(node0, node1, 0, 1, 0));
+    edgegraph.add(new ListEdge(node1, node2, 0, 2, 0));
+    edgegraph.add(new ListEdge(node2, node3, 0, 3, 0));
+    edgegraph.add(new ListEdge(node3, node4, 0, 4, 0));
+
+    ListGraph lg = new ListGraph(edgegraph);
+
+    Vector<ListNode> nodes = lg.getNodes();
+    Vector<ListEdge> edges = lg.getEdges();
+
+    Iterator<ListNode> nodesit = nodes.iterator();
+    Iterator<ListEdge> edgesit = edges.iterator();
+
+    System.out.println("Nodes: ");
+    while (nodesit.hasNext())
+      System.out.println(nodesit.next().toString());
+
+    System.out.println("Edges: ");
+    while (edgesit.hasNext())
+      System.out.println(edgesit.next().toString());
+
+    System.out.println("nodes.get(2).getID(): " + nodes.get(2).getID());
+    System.out.println("true: " + nodes.get(2).isEqual(nodes.get(2)));
+    System.out.println("false: " + nodes.get(2).isEqual(nodes.get(3)));
+    System.out.println("3.0: " + edges.get(2).getDistance());
+    System.out.println("true: " + edges.get(2).isEqual(edges.get(2)));
+    System.out.println("false: " + edges.get(2).isEqual(edges.get(3)));
+
+    System.out.println("neighbours of " + nodes.get(3) + ":");
+    Vector<ListNode> neighbours = lg.getNeighbours(nodes.get(3));
+    Iterator<ListNode> neighboursit = neighbours.iterator();
+
+    while (neighboursit.hasNext())
+      System.out.println(neighboursit.next().toString());
+  }
+
+  public static void main(String[] args) {
+    GraphTest.MatrixGraphTest();
+    System.out.println("==============");
+    GraphTest.ListGraphTest();
+  }
+
 }
-- 
2.11.4.GIT