diff --git a/platform/vcs-log/graph/src/com/intellij/vcs/log/graph/linearBek/GraphVisitorAlgorithm.java b/platform/vcs-log/graph/src/com/intellij/vcs/log/graph/linearBek/GraphVisitorAlgorithm.java
deleted file mode 100644
index 315b622eb271..000000000000
--- a/platform/vcs-log/graph/src/com/intellij/vcs/log/graph/linearBek/GraphVisitorAlgorithm.java
+++ /dev/null
@@ -1,105 +0,0 @@
-/*
- * Copyright 2000-2014 JetBrains s.r.o.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package com.intellij.vcs.log.graph.linearBek;
-
-import com.intellij.openapi.diagnostic.Logger;
-import com.intellij.util.containers.IntStack;
-import com.intellij.vcs.log.graph.api.GraphLayout;
-import com.intellij.vcs.log.graph.api.LinearGraph;
-import com.intellij.vcs.log.graph.utils.impl.BitSetFlags;
-import org.jetbrains.annotations.NotNull;
-
-import java.util.Collections;
-import java.util.List;
-
-import static com.intellij.vcs.log.graph.utils.LinearGraphUtils.getDownNodes;
-import static com.intellij.vcs.log.graph.utils.LinearGraphUtils.getUpNodes;
-
-// better DfsUtil, with ... uh ... well ... you know
-public class GraphVisitorAlgorithm {
-  private static final Logger LOG = Logger.getInstance(GraphVisitorAlgorithm.class);
-
-  private static final int NODE_NOT_FOUND = -1;
-  private final boolean myBackwards;
-
-  public GraphVisitorAlgorithm(boolean backwards) {
-    myBackwards = backwards;
-  }
-
-  public void visitGraph(@NotNull final LinearGraph graph, @NotNull GraphLayout layout, @NotNull GraphVisitor visitor) {
-    final BitSetFlags visited = new BitSetFlags(graph.nodesCount(), false);
-    for (int head : layout.getHeadNodeIndex()) {
-      IntStack stack = new IntStack();
-
-      visited.set(head, true);
-      stack.push(head);
-      visitor.enterSubtree(head, head, visited);
-
-      while (!stack.empty()) {
-        int nextNode = nextNode(graph, layout, stack.peek(), visited);
-        if (nextNode != NODE_NOT_FOUND) {
-          visited.set(nextNode, true);
-          stack.push(nextNode);
-          visitor.enterSubtree(nextNode, head, visited);
-        }
-        else {
-          visitor.leaveSubtree(stack.pop(), head, visited);
-        }
-      }
-
-      visitor.leaveSubtree(head, head, visited);
-    }
-
-    if (Boolean.getBoolean("idea.is.internal")) { // do not want to depend on Application here
-      for (int i = 0; i < visited.size(); i++) {
-        if (!visited.get(i)) {
-          LOG.warn("Missed node " + i);
-        }
-      }
-    }
-  }
-
-  private int nextNode(@NotNull LinearGraph graph, @NotNull GraphLayout layout, int currentNode, @NotNull BitSetFlags visited) {
-    List<Integer> downNodes = getDownNodes(graph, currentNode);
-    if (myBackwards) Collections.reverse(downNodes);
-    int li = layout.getLayoutIndex(currentNode);
-
-    for (int downNode : downNodes) {
-      if (!visited.get(downNode)) {
-
-        boolean canGoThere = true;
-        List<Integer> upNodes = getUpNodes(graph, downNode);
-        for (int upNode : upNodes) {
-          if (!visited.get(upNode) && layout.getLayoutIndex(upNode) <= li) {
-            canGoThere = false;
-            break;
-          }
-        }
-
-        if (canGoThere) {
-          return downNode;
-        }
-      }
-    }
-    return NODE_NOT_FOUND;
-  }
-
-  public interface GraphVisitor {
-    void enterSubtree(int nodeIndex, int currentHead, BitSetFlags visited);
-
-    void leaveSubtree(int nodeIndex, int currentHead, BitSetFlags visited); // TODO make it better
-  }
-}