Package org.opentripplanner.routing.edgetype

Examples of org.opentripplanner.routing.edgetype.BikeParkEdge

160
161
162
163
164
165
166
167
168
169
170
                            .connectVertexToStreets(bikeParkVertex);
                    for (Edge e : request.getEdgesAdded()) {
                        graph.addTemporaryEdge(e);
                    }
                    verticesByPark.put(bikePark, bikeParkVertex);
                    new BikeParkEdge(bikeParkVertex);
                } else {
                    bikeParkVertex.setSpacesAvailable(bikePark.spacesAvailable);
                }
            }
            /* Remove existing parks that were not present in the update */
 
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
        bpc.name = "Bike Park C";
        bpc.x = 0.002;
        bpc.y = 45.00001;
        bpc.spacesAvailable = 1;
        BikeParkVertex BPRC = new BikeParkVertex(graph, bpc);
        new BikeParkEdge(BPRC);
        new StreetBikeParkLink(BPRC, C);
        new StreetBikeParkLink(C, BPRC);

        // Still impossible from B to D by bike only (CD is WALK only).
        options = new RoutingRequest("BICYCLE");
View Full Code Here
356
357
358
359
360
361
362
363
364
                bikePark.name = creativeName;
                bikePark.x = node.lon;
                bikePark.y = node.lat;
                bikeRentalService.addBikePark(bikePark);
                BikeParkVertex parkVertex = new BikeParkVertex(graph, bikePark);
                new BikeParkEdge(parkVertex);
            }
            LOG.info("Created " + n + " bike P+R.");
        }
View Full Code Here
402
403
404
405
406
407
408
409
            bikePark.name = creativeName;
            bikePark.x = (envelope.getMinX() + envelope.getMaxX()) / 2;
            bikePark.y = (envelope.getMinY() + envelope.getMaxY()) / 2;
            bikeRentalService.addBikePark(bikePark);
            BikeParkVertex bikeParkVertex = new BikeParkVertex(graph, bikePark);
            new BikeParkEdge(bikeParkVertex);
            LOG.debug("Created area bike P+R '{}' ({})", creativeName, osmId);
        }
View Full Code Here
60
61
62
63
64
65
66
67
68
        Collection<BikePark> bikeParks = dataSource.getBikeParks();

        for (BikePark bikePark : bikeParks) {
            service.addBikePark(bikePark);
            BikeParkVertex bikeParkVertex = new BikeParkVertex(graph, bikePark);
            new BikeParkEdge(bikeParkVertex);
        }
        LOG.info("Created " + bikeParks.size() + " bike parks.");
    }
View Full Code Here
TOP

Related Classes of org.opentripplanner.routing.edgetype.BikeParkEdge

  • org.opentripplanner.graph_builder.impl.bike.BikeParkGraphBuilder
  • org.opentripplanner.graph_builder.impl.osm.OpenStreetMapGraphBuilderImpl$Handler
  • org.opentripplanner.routing.algorithm.TestParkAndRide
  • org.opentripplanner.routing.core.RoutingRequest
  • org.opentripplanner.routing.core.State
  • org.opentripplanner.routing.core.StateEditor
  • org.opentripplanner.routing.vertextype.BikeParkVertex
  • org.opentripplanner.updater.bike_park.BikeParkUpdater$BikeParkGraphWriterRunnable
    • 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.