From 27b38da2ef4e836c65e517e2161af9e11db049c5 Mon Sep 17 00:00:00 2001
From: Mikhaylo Demianenko <mikhaylo.demianenko@neotechnology.com>
Date: Fri, 2 Sep 2016 15:38:31 +0200
Subject: [PATCH] Cleanup imports.

---
 .../org/neo4j/graphalgo/impl/path/DijkstraBidirectional.java | 5 ++---
 .../graphalgo/impl/util/DijkstraBranchCollisionDetector.java | 5 ++---
 2 files changed, 4 insertions(+), 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
index 6c83b4f44a513..384e80fe4e9df 100644
--- 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/community/graph-algo/src/main/java/org/neo4j/graphalgo/impl/util/DijkstraBranchCollisionDetector.java b/community/graph-algo/src/main/java/org/neo4j/graphalgo/impl/util/DijkstraBranchCollisionDetector.java
index 06f8838a44143..d095178ac75ee 100644
--- a/community/graph-algo/src/main/java/org/neo4j/graphalgo/impl/util/DijkstraBranchCollisionDetector.java
+++ b/community/graph-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;