Makes maxVisitedNodes in NodeContractor a local variable.

Signed-off-by: ammagamma <contactammagamma@gmail.com>
graphhopper · May 9, 2018 · 3723f06 · 3723f06
1 parent 0a1afb1
commit 3723f06
Showing 1 changed file with 2 additions and 3 deletions.
diff --git a/core/src/main/java/com/graphhopper/routing/ch/NodeContractor.java b/core/src/main/java/com/graphhopper/routing/ch/NodeContractor.java
@@ -47,7 +47,6 @@ class NodeContractor {
     private DijkstraOneToMany prepareAlgo;
     private int addedShortcutsCount;
     private long dijkstraCount;
-    private int maxVisitedNodes = Integer.MAX_VALUE;
     private StopWatch dijkstraSW = new StopWatch();
     private int maxEdgesCount;
     private int maxLevel;
@@ -117,7 +116,7 @@ private CalcShortcutsResult calcShortcutCount(int node) {
      * here the degree is not the total number of adjacent edges, but only the number of incoming edges
      */
     private long findShortcuts(ShortcutHandler sch) {
-        this.maxVisitedNodes = getMaxVisitedNodesEstimate();
+        int maxVisitedNodes = getMaxVisitedNodesEstimate();
         long degree = 0;
         EdgeIterator incomingEdges = vehicleInExplorer.setBaseNode(sch.getNode());
         // collect outgoing nodes (goal-nodes) only once
@@ -293,7 +292,7 @@ float getDijkstraSeconds() {
      * lead to a slowish or even endless loop.
      */
     public float calculatePriority(int node) {
-        NodeContractor.CalcShortcutsResult calcShortcutsResult = calcShortcutCount(node);
+        CalcShortcutsResult calcShortcutsResult = calcShortcutCount(node);
 
         // # huge influence: the bigger the less shortcuts gets created and the faster is the preparation
         //