incubator-hama-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From edwardy...@apache.org
Subject svn commit: r1229056 - /incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java
Date Mon, 09 Jan 2012 08:16:27 GMT
Author: edwardyoon
Date: Mon Jan  9 08:16:27 2012
New Revision: 1229056

URL: http://svn.apache.org/viewvc?rev=1229056&view=rev
Log:
Fix my typos

Modified:
    incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java

Modified: incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java
URL: http://svn.apache.org/viewvc/incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java?rev=1229056&r1=1229055&r2=1229056&view=diff
==============================================================================
--- incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java
(original)
+++ incubator/hama/trunk/examples/src/test/java/org/apache/hama/examples/ShortestPathsTest.java
Mon Jan  9 08:16:27 2012
@@ -57,7 +57,7 @@ public class ShortestPathsTest extends T
 
   private void verifyResult() throws IOException {
     Map<String, Integer> rs = new HashMap<String, Integer>();
-    rs.put("Erfurt", 385);
+    rs.put("Erfurt", 403);
     rs.put("Mannheim", 85);
     rs.put("Stuttgart", 503);
     rs.put("Kassel", 173);
@@ -114,7 +114,7 @@ public class ShortestPathsTest extends T
       } else if (city.equals("Wuerzburg")) {
         ShortestPathVertex[] textArr = new ShortestPathVertex[3];
         textArr[0] = new ShortestPathVertex(217, "Frankfurt");
-        textArr[1] = new ShortestPathVertex(168, "Erfurt");
+        textArr[1] = new ShortestPathVertex(186, "Erfurt");
         textArr[2] = new ShortestPathVertex(103, "Nuernberg");
         ShortestPathVertexArrayWritable arr = new ShortestPathVertexArrayWritable();
         arr.set(textArr);
@@ -151,7 +151,7 @@ public class ShortestPathsTest extends T
       } else if (city.equals("Muenchen")) {
         ShortestPathVertex[] textArr = new ShortestPathVertex[3];
         textArr[0] = new ShortestPathVertex(167, "Nuernberg");
-        textArr[1] = new ShortestPathVertex(173, "Kassel");
+        textArr[1] = new ShortestPathVertex(502, "Kassel");
         textArr[2] = new ShortestPathVertex(84, "Augsburg");
         ShortestPathVertexArrayWritable arr = new ShortestPathVertexArrayWritable();
         arr.set(textArr);



Mime
View raw message