Cleanup imports.

neo4j · Sep 2, 2016 · 27b38da · 27b38da
1 parent 461e6de
commit 27b38da
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 6 deletions.
diff --git a/community/graph-algo/src/main/java/org/neo4j/graphalgo/impl/path/DijkstraBidirectional.java b/community/graph-algo/src/main/java/org/neo4j/graphalgo/impl/path/DijkstraBidirectional.java
@@ -109,8 +109,7 @@ public Iterable<WeightedPath> findAllPaths( Node start, final Node end )
     private Traverser traverser( Node start, final Node end, PathInterest interest )
     {
         final MutableDouble shortestSoFar = new MutableDouble( Double.MAX_VALUE );
-        final org.apache.commons.lang3.mutable.MutableDouble
-                startSideShortest = new org.apache.commons.lang3.mutable.MutableDouble( 0 );
+        final MutableDouble startSideShortest = new MutableDouble( 0 );
         final MutableDouble endSideShortest = new MutableDouble( 0 );
         PathExpander dijkstraExpander = new DijkstraBidirectionalPathExpander( expander, shortestSoFar, true,
                 startSideShortest, endSideShortest, epsilon);
@@ -166,7 +165,7 @@ private static class DijkstraBidirectionalPathExpander implements PathExpander<D
         private final boolean stopAfterLowestCost;
 
         DijkstraBidirectionalPathExpander( PathExpander source, MutableDouble shortestSoFar,
-                boolean stopAfterLowestCost, org.apache.commons.lang3.mutable.MutableDouble thisSideShortest, MutableDouble otherSideShortest,
+                boolean stopAfterLowestCost, MutableDouble thisSideShortest, MutableDouble otherSideShortest,
                 double epsilon )
         {
             this.source = source;

diff --git a/...aph-algo/src/main/java/org/neo4j/graphalgo/impl/util/DijkstraBranchCollisionDetector.java b/...aph-algo/src/main/java/org/neo4j/graphalgo/impl/util/DijkstraBranchCollisionDetector.java
@@ -39,9 +39,8 @@ public class DijkstraBranchCollisionDetector extends StandardBranchCollisionDete
     private final MutableDouble shortestSoFar;
     private final double epsilon;
 
-    public DijkstraBranchCollisionDetector( Evaluator evaluator,
-            CostEvaluator costEvaluator,
-            org.apache.commons.lang3.mutable.MutableDouble shortestSoFar, double epsilon, Predicate<Path> pathPredicate )
+    public DijkstraBranchCollisionDetector( Evaluator evaluator, CostEvaluator costEvaluator,
+            MutableDouble shortestSoFar, double epsilon, Predicate<Path> pathPredicate )
     {
         super( evaluator, pathPredicate );
         this.costEvaluator = costEvaluator;