Fixed graph relaxEdge to properly deal with Double.MIN_VALUE.

@@ -108,7 +108,7 @@ public class PointToPointIntentCompiler
                 if (lt == Link.Type.OPTICAL) {
                 if (lt == Link.Type.OPTICAL) {
                     return 1000.0;
                     return 1000.0;
                 } else {
                 } else {
-                    return 1.0;
+                    return Double.MIN_VALUE;
                 }
                 }
             }
             }
         };
         };

@@ -36,7 +36,7 @@ import static com.google.common.base.Preconditions.checkNotNull;
 public abstract class AbstractGraphPathSearch<V extends Vertex, E extends Edge<V>>
 public abstract class AbstractGraphPathSearch<V extends Vertex, E extends Edge<V>>
         implements GraphPathSearch<V, E> {
         implements GraphPathSearch<V, E> {
 
 
-    private double samenessThreshold = 0.000000001;
+    private double samenessThreshold = Double.MIN_VALUE;
 
 
     /**
     /**
      * Sets a new sameness threshold for comparing cost values; default is
      * Sets a new sameness threshold for comparing cost values; default is
@@ -183,7 +183,7 @@ public abstract class AbstractGraphPathSearch<V extends Vertex, E extends Edge<V
 
 
             double newCost = cost + hopCost;
             double newCost = cost + hopCost;
             boolean relaxed = newCost < oldCost;
             boolean relaxed = newCost < oldCost;
-            boolean same = Math.abs(newCost - oldCost) < samenessThreshold;
+            boolean same = Math.abs(newCost - oldCost) <= samenessThreshold;
             if (same || relaxed) {
             if (same || relaxed) {
                 updateVertex(v, e, newCost, !same);
                 updateVertex(v, e, newCost, !same);
             }
             }