/* 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.vertextype;
import org.onebusaway.gtfs.model.StopTime;
import org.onebusaway.gtfs.model.Trip;
import org.opentripplanner.gtfs.GtfsLibrary;
import org.opentripplanner.routing.edgetype.TableTripPattern;
import org.opentripplanner.routing.graph.Graph;
public class PatternArriveVertex extends PatternStopVertex {
private static final long serialVersionUID = 4858000141204480555L;
public PatternArriveVertex(Graph g, TableTripPattern tripPattern, StopTime stopTime) {
super(g, makeLabel(tripPattern.getExemplar(), stopTime), tripPattern, stopTime.getStop());
}
// constructor for single-trip hops with no trip pattern
public PatternArriveVertex(Graph g, Trip trip, StopTime stopTime) {
super(g, makeLabel(trip, stopTime), null, stopTime.getStop());
}
private static String makeLabel(Trip t, StopTime st) {
return GtfsLibrary.convertIdToString(st.getStop().getId()) + "_" +
GtfsLibrary.convertIdToString(t.getId()) + "_" +
st.getStopSequence() + "_A";
}
}