Package org.opentripplanner.routing.graph

Examples of org.opentripplanner.routing.graph.Graph

221
222
223
224
225
226
227
228
229
230
231
232
233
        states = path.states.toArray(states);

        Edge[] edges = new Edge[path.edges.size()];
        edges = path.edges.toArray(edges);

        Graph graph = path.getRoutingContext().graph;

        FareService fareService = graph.getService(FareService.class);

        State[][] legsStates = sliceStates(states);

        if (fareService != null) {
            itinerary.fare = fareService.getCost(path);
View Full Code Here
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
    }

    /** Returns the first trip of the service day. Currently unused.
     * TODO This should probably be done with a special time value. */
    public TripPlan generateFirstTrip(RoutingRequest request) {
        Graph graph = graphService.getGraph(request.routerId);

        request.setArriveBy(false);

        TimeZone tz = graph.getTimeZone();

        GregorianCalendar calendar = new GregorianCalendar(tz);
        calendar.setTimeInMillis(request.dateTime * 1000);
        calendar.set(Calendar.HOUR, 0);
        calendar.set(Calendar.MINUTE, 0);
View Full Code Here
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
    }

    /** Return the last trip of the service day. Currently unused.
     * TODO This should probably be done with a special time value. */
    public TripPlan generateLastTrip(RoutingRequest request) {
        Graph graph = graphService.getGraph(request.routerId);

        request.setArriveBy(true);

        TimeZone tz = graph.getTimeZone();

        GregorianCalendar calendar = new GregorianCalendar(tz);
        calendar.setTimeInMillis(request.dateTime * 1000);
        calendar.set(Calendar.HOUR, 0);
        calendar.set(Calendar.MINUTE, 0);
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
        // Build the request
        try {
            RoutingRequest req = buildRequest(0); // batch must be true
          
            Graph graph;
           
            // routerId is optional -- select default graph if not set
          if(routerId == null || routerId.isEmpty()) {
            graph = server.graphService.getGraph();
          }
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
        if (surf == null) return badRequest("Invalid TimeSurface ID.");
        final PointSet pset = server.pointSetCache.get(targetPointSetId);
        if (pset == null) return badRequest("Missing or invalid target PointSet ID.");
       
        //TODO cache this sampleset
        Graph gg = server.graphService.getGraph(surf.routerId);
        SampleSet samples = pset.getSampleSet( gg );
       
        final ResultFeature indicator = new ResultFeature(samples, surf);
        if (indicator == null) return badServer("Could not compute indicator as requested.");
        return Response.ok().entity(new StreamingOutput() {
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
147
                    .build());
        return routerInfo;
    }
   
    private RouterInfo getRouterInfo(String routerId) {
        Graph graph = server.graphService.getGraph(routerId);
        if (graph == null) return null;
        RouterInfo routerInfo = new RouterInfo();
        routerInfo.routerId = routerId;
        routerInfo.polygon = graph.getHull();
        routerInfo.buildTime = graph.buildTime;
        return routerInfo;
    }
View Full Code Here
203
204
205
206
207
208
209
210
211
212
213
214
215
216
        if (preEvict) {
            LOG.debug("pre-evicting graph");
            server.graphService.evictGraph(routerId);
        }
        LOG.debug("deserializing graph from POST data stream...");
        Graph graph;
        try {
            graph = Graph.load(is, level);
            server.graphService.registerGraph(routerId, new MemoryGraphSource(routerId, graph));
            return Response.status(Status.CREATED).entity(graph.toString() + "\n").build();
        } catch (Exception e) {
            return Response.status(Status.BAD_REQUEST).entity(e.toString() + "\n").build();
        }
    }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
            file.delete();
        }
       
        tempDir.delete();
       
        Graph graph = graphBuilder.getGraph();
        graph.index(new DefaultStreetVertexIndexFactory());
       
        server.graphService.registerGraph(routerId, new MemoryGraphSource(routerId, graph));
        return Response.status(Status.CREATED).entity(graph.toString() + "\n").build();
    }
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
133
134
        if (thisState.isCarParked() != other.isCarParked())
            return false;
        if (thisState.isBikeParked() != other.isBikeParked())
            return false;

        Graph graph = thisState.getOptions().rctx.graph;
        if (thisState.backEdge != other.getBackEdge() && ((thisState.backEdge instanceof StreetEdge)
                && (!graph.getTurnRestrictions(thisState.backEdge).isEmpty())))
            return false;

        if (thisState.routeSequenceSubset(other)) {
            // TODO subset is not really the right idea
            return thisState.weight <= other.weight &&
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
     * {@link ShortestPathTree} Interface
     ****/

    @Override
    public boolean add(State state) {
        Graph graph = state.getOptions().rctx.graph;
        Vertex here = state.getVertex();
        State existing = states.get(here);
        if (existing == null || state.betterThan(existing)) {
            states.put(here, state);
            return true;
        } else {
            final Edge backEdge = existing.getBackEdge();
            // If the previous back edge had turn restrictions, we need to continue
            // the search because the previous path may be prevented by from reaching the end by
            // turn restrictions.

            return !graph.getTurnRestrictions(backEdge).isEmpty();
        }
    }
View Full Code Here
TOP

Related Classes of org.opentripplanner.routing.graph.Graph

  • com.vividsolutions.jts.geom.Envelope
  • org.onebusaway.gtfs.impl.calendar.CalendarServiceImpl
  • org.onebusaway.gtfs.model.calendar.CalendarServiceData
  • org.onebusaway.gtfs.services.calendar.CalendarService
  • org.opentripplanner.analyst.batch.GraphGeographicFilter
  • org.opentripplanner.analyst.core.GeometryIndex
  • org.opentripplanner.analyst.PointSet
  • org.opentripplanner.analyst.request.SampleFactory
  • org.opentripplanner.api.resource.BikeRental
  • org.opentripplanner.api.resource.Context
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.