/* This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. */ package org.opentripplanner.routing.impl; import java.util.Collections; import java.util.List; import org.opentripplanner.routing.core.RoutingRequest; import org.opentripplanner.routing.services.GraphService; import org.opentripplanner.routing.services.PathService; import org.opentripplanner.routing.services.SPTService; import org.opentripplanner.routing.spt.GraphPath; import org.opentripplanner.routing.spt.ShortestPathTree; import org.springframework.beans.factory.annotation.Autowired; public class TrivialPathServiceImpl implements PathService { @Autowired GraphService graphService; @Autowired SPTService sptService; @Override public List<GraphPath> getPaths(RoutingRequest options) { ShortestPathTree spt = sptService.getShortestPathTree(options); if (spt == null) { return Collections.emptyList(); } return spt.getPaths(); } }