Package org.opentripplanner.routing.edgetype

Examples of org.opentripplanner.routing.edgetype.ParkAndRideLinkEdge

90
91
92
93
94
95
96
97
98
99
100
101
        // So we Add a P+R at B.
        ParkAndRideVertex PRB = new ParkAndRideVertex(graph, "P+R", "P+R.B", 0.001, 45.00001,
                "P+R B");
        new ParkAndRideEdge(PRB);
        new ParkAndRideLinkEdge(PRB, B);
        new ParkAndRideLinkEdge(B, PRB);

        // But it is still impossible to get from A to C by WALK only
        // (AB is CAR only).
        options = new RoutingRequest("WALK");
        options.freezeTraverseMode();
View Full Code Here
495
496
497
498
499
500
501
502
503
504
505
            ParkAndRideVertex parkAndRideVertex = new ParkAndRideVertex(graph, "P+R" + osmId,
                    "P+R_" + osmId, (envelope.getMinX() + envelope.getMaxX()) / 2,
                    (envelope.getMinY() + envelope.getMaxY()) / 2, creativeName);
            new ParkAndRideEdge(parkAndRideVertex);
            for (IntersectionVertex accessVertex : accessVertexes) {
                new ParkAndRideLinkEdge(parkAndRideVertex, accessVertex);
                new ParkAndRideLinkEdge(accessVertex, parkAndRideVertex);
            }
            LOG.debug("Created P+R '{}' ({})", creativeName, osmId);
            return true;
        }
View Full Code Here
TOP

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

  • com.vividsolutions.jts.geom.Coordinate
  • org.opentripplanner.common.geometry.DistanceLibrary
  • org.opentripplanner.graph_builder.impl.osm.OpenStreetMapGraphBuilderImpl$Handler
  • org.opentripplanner.routing.algorithm.TestParkAndRide
  • org.opentripplanner.routing.core.StateEditor
  • org.opentripplanner.routing.core.TraverseMode
  • org.opentripplanner.routing.graph.Edge
    • 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.