diff --git a/api/server/src/main/java/org/softwareheritage/graph/algo/Visit.java b/api/server/src/main/java/org/softwareheritage/graph/algo/Visit.java
index e73d1d3..88c3db9 100644
--- a/api/server/src/main/java/org/softwareheritage/graph/algo/Visit.java
+++ b/api/server/src/main/java/org/softwareheritage/graph/algo/Visit.java
@@ -1,63 +1,65 @@
 package org.softwareheritage.graph.algo;
 
 import java.util.ArrayList;
 import java.util.Stack;
 
 import it.unimi.dsi.big.webgraph.LazyLongIterator;
 import it.unimi.dsi.bits.LongArrayBitVector;
 
 import org.softwareheritage.graph.Graph;
 
 public class Visit {
   public class Path extends ArrayList<String> {}
 
   Graph graph;
-  LongArrayBitVector visited;
-  ArrayList<String> extraEdges;
+  String allowedEdges;
   Stack<Long> currentPath;
   ArrayList<Path> paths;
+  LongArrayBitVector visited;
 
-  public Visit(Graph graph, String start, ArrayList<String> extraEdges) {
+  public Visit(Graph graph, String start, String allowedEdges, String algorithm) {
     this.graph = graph;
-    this.visited = LongArrayBitVector.ofLength(graph.getNbNodes());
-    this.extraEdges = extraEdges;
+    this.allowedEdges = allowedEdges;
     this.paths = new ArrayList<Path>();
     this.currentPath = new Stack<Long>();
+    this.visited = LongArrayBitVector.ofLength(graph.getNbNodes());
 
-    recursiveVisit(graph.getNode(start));
+    if (algorithm == "dfs") {
+      dfs(graph.getNode(start));
+    }
   }
 
   // Allow Jackson JSON to only serialize the 'paths' field
   public ArrayList<Path> getPaths() {
     return paths;
   }
 
-  private void recursiveVisit(long current) {
+  private void dfs(long current) {
     visited.set(current);
     currentPath.push(current);
 
     long degree = graph.outdegree(current);
     if (degree == 0) {
       Path path = new Path();
       for (long node : currentPath) {
         path.add(graph.getHash(node));
       }
       paths.add(path);
     }
 
     LazyLongIterator successors = graph.successors(current);
     while (degree-- > 0) {
       long next = successors.nextLong();
-      if (traversalAllowed(current, next) && !visited.getBoolean(next)) {
-        recursiveVisit(next);
+      if (isEdgeAllowed(current, next) && !visited.getBoolean(next)) {
+        dfs(next);
       }
     }
 
     currentPath.pop();
   }
 
-  private boolean traversalAllowed(long current, long next) {
+  private boolean isEdgeAllowed(long current, long next) {
     // TODO
     return true;
   }
 }