diff --git a/core/src/main/java/ru/trader/analysis/VendorsGraph.java b/core/src/main/java/ru/trader/analysis/VendorsGraph.java
index e28539e..ba43637 100644
--- a/core/src/main/java/ru/trader/analysis/VendorsGraph.java
+++ b/core/src/main/java/ru/trader/analysis/VendorsGraph.java
@@ -533,6 +533,18 @@ public class VendorsGraph extends ConnectibleGraph<Vendor> {
                 return edge.getInstance(fuel, balance);
             }
 
+            @Override
+            public double getWeight() {
+                if (weight == null){
+                    Edge<Vendor> edge = getEdge();
+                    Optional<Traversal<Vendor>> head = getHead();
+                    weight = (head.isPresent() ? ((VendorsTraversalEntry)head.get()).getWeight() : 0)  + (edge != null ? edge.getWeight() : 0);
+                    if (edge != null){
+                        weight = weight / (1+Math.floorDiv(profile.getLands() - this.size(),this.size()));
+                    }
+                }
+                return weight;
+            }
         }
 
 
diff --git a/core/src/main/java/ru/trader/analysis/graph/Crawler.java b/core/src/main/java/ru/trader/analysis/graph/Crawler.java
index ddce30a..9de9064 100644
--- a/core/src/main/java/ru/trader/analysis/graph/Crawler.java
+++ b/core/src/main/java/ru/trader/analysis/graph/Crawler.java
@@ -334,7 +334,7 @@ public class Crawler<T> {
             while (!cur.isRoot()){
                 Edge<T> edge = cur.getEdge();
                 Edge<T> oEdge = oCur.getEdge();
-                cmp = Double.compare(oEdge.weight, edge.weight);
+                cmp = oEdge.compareTo(edge);
                 if (cmp != 0) return cmp;
                 cur = (CostTraversal<T>) cur.getHead().get();
                 oCur = (CostTraversal<T>) oCur.getHead().get();
@@ -568,7 +568,7 @@ public class Crawler<T> {
     }
 
     protected class CostTraversalEntry extends TraversalEntry implements CostTraversal<T>, Comparable<CostTraversalEntry>{
-        private Double weight;
+        protected Double weight;
 
         protected CostTraversalEntry(Vertex<T> vertex) {
             super(vertex);