Package org.opentripplanner.routing.algorithm.strategies

Examples of org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic

107
108
109
110
111
112
113
114
115
116
117
        runState.spt = new MultiShortestPathTree(runState.options);
        //runState.spt = new EarliestArrivalShortestPathTree(options); //MultiShortestPathTree(runState.options);

        runState.heuristic = options.batch ?
                new TrivialRemainingWeightHeuristic() : runState.rctx.remainingWeightHeuristic;

        // Since initial states can be multiple, heuristic cannot depend on the initial state.
        runState.heuristic.initialize(runState.options, runState.rctx.origin, runState.rctx.target,
                abortTime);
        if (abortTime < Long.MAX_VALUE  && System.currentTimeMillis() > abortTime) {
View Full Code Here
304
305
306
307
308
309
310
311
312
313
314
        origin = opt.arriveBy ? toVertex : fromVertex;
        originBackEdge = opt.arriveBy ? toBackEdge : fromBackEdge;
        target = opt.arriveBy ? fromVertex : toVertex;
        transferTable = graph.getTransferTable();
        if (opt.batch)
            remainingWeightHeuristic = new TrivialRemainingWeightHeuristic();
        else
            remainingWeightHeuristic = heuristicFactory.getInstanceForSearch(opt);

        // If any temporary half-street-edges were created, record the fact that they should
        // only be visible to the routing context we are currently constructing.
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
        LOG.debug("rreq={}", options);
       
        RemainingWeightHeuristic heuristic;
        if (options.disableRemainingWeightHeuristic) {
            heuristic = new TrivialRemainingWeightHeuristic();
        } else if (options.modes.isTransit()) {
            // Only use the BiDi heuristic for transit.
            heuristic = new InterleavedBidirectionalHeuristic(options.rctx.graph);
        } else {
            heuristic = new DefaultRemainingWeightHeuristic();
View Full Code Here
TOP

Related Classes of org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic

  • org.opentripplanner.routing.algorithm.GenericAStar
  • org.opentripplanner.routing.core.RoutingContext
  • org.opentripplanner.routing.impl.LongDistancePathService
    • 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.