commit 4d69087215ae59342d519c4f37df2237070556c1
author Thomas Vachuska <tom@onlab.us> Mon Oct 27 08:57:08 2014 -0700
committer Thomas Vachuska <tom@onlab.us> Mon Oct 27 08:57:08 2014 -0700
tree 110382c901e709b94066ef2c716cb23699ae9418
parent eb24e9d0ac17a39025f908348bb496c5b4ca7bcd

Doh! Forgot to actually check for negative cycles in relaxEdge.

utils/misc/src/main/java/org/onlab/graph/DijkstraGraphSearch.java

diff --git a/utils/misc/src/main/java/org/onlab/graph/DijkstraGraphSearch.java b/utils/misc/src/main/java/org/onlab/graph/DijkstraGraphSearch.java
index 535da09..8f1bad0 100644
--- a/utils/misc/src/main/java/org/onlab/graph/DijkstraGraphSearch.java
+++ b/utils/misc/src/main/java/org/onlab/graph/DijkstraGraphSearch.java
@@ -40,7 +40,7 @@
             if (cost < Double.MAX_VALUE) {
                 // If the vertex is reachable, relax all its egress edges.
                 for (E e : graph.getEdgesFrom(nearest)) {
-                    result.relaxEdge(e, cost, weight);
+                    result.relaxEdge(e, cost, weight, true);
                 }
             }