Remove unused method

mfdz · Mar 25, 2022 · e15bb2b · e15bb2b
1 parent 6d0772f
commit e15bb2b
Show file tree

Hide file tree

Showing 2 changed files with 0 additions and 33 deletions.
diff --git a/src/main/java/org/opentripplanner/routing/algorithm/astar/AStar.java b/src/main/java/org/opentripplanner/routing/algorithm/astar/AStar.java
@@ -279,30 +279,6 @@ public ShortestPathTree getShortestPathTree(RoutingRequest options, double relTi
 
         return spt;
     }
-
-    /** Get an SPT, starting from a collection of states */
-    public ShortestPathTree getShortestPathTree(RoutingRequest options, double relTimeoutSeconds,
-            SearchTerminationStrategy terminationStrategy, Collection<State> initialStates) {
-
-        ShortestPathTree spt = null;
-        long abortTime = DateUtils.absoluteTimeout(relTimeoutSeconds);
-
-        startSearch (options, terminationStrategy, abortTime, false);
-
-        if (runState != null) {
-            for (State state : initialStates) {
-                runState.spt.add(state);
-                // TODO: hardwired for earliest arrival
-                // TODO: weights are seconds, no?
-                runState.pq.insert(state, state.getElapsedTimeSeconds());
-            }
-
-            runSearch(abortTime);
-            spt = runState.spt;
-        }
-
-        return spt;
-    }
 
     public void setTraverseVisitor(TraverseVisitor traverseVisitor) {
         this.traverseVisitor = traverseVisitor;

diff --git a/src/main/java/org/opentripplanner/routing/spt/ShortestPathTree.java b/src/main/java/org/opentripplanner/routing/spt/ShortestPathTree.java
@@ -62,15 +62,6 @@ public List<GraphPath> getPaths(Vertex dest) {
         return ret;
     }
 
-    /** @return a default set of back-optimized paths to the target vertex. */
-    public List<GraphPath> getPaths() {
-        List<GraphPath> graphPaths = new ArrayList<>();
-        for (Vertex vertex : options.getRoutingContext().toVertices) {
-            graphPaths.addAll(getPaths(vertex));
-        }
-        return graphPaths;
-    }
-
     /** @return a single optimal, optionally back-optimized path to the given vertex. */
     public GraphPath getPath(Vertex dest) {
         State s = getState(dest);