Examples of org.opentripplanner.routing.spt.ShortestPathTree.visit()

org.opentripplanner.routing.spt.ShortestPathTree.visit()

The visit method should generally be called upon extracting a State from a priority queue. It checks whether the State is still worth visiting (i.e. whether it has been dominated since it was enqueued) and informs the ShortestPathTree that this State's outgoing edges have been relaxed. Note: This is necessary because OTP priority queues are not required to implement the decrease-key operation. In fact, decrease-key is not relevant when it is possible to have several States per vertex, as in multi-criteria time-dependent routing. Since a state may remain in the priority queue after being dominated, such sub-optimal States must be caught as they come out of the queue to avoid unnecessary branching. @param s - the state about to be visited @return - whether this state is still considered worth visiting.

        pq.insert(initialState, 0);


        while (!pq.empty()) {
            State u = pq.extract_min();
            Vertex u_vertex = u.getVertex();
            if (!spt.visit(u))
                continue;
            Collection<Edge> edges = options.arriveBy ? u_vertex.getIncoming() : u_vertex.getOutgoing();
            for (Edge edge : edges) {
                for (State v = edge.traverse(u); v != null; v = v.getNextResult()) {
                    if (isWorstTimeExceeded(v, options)) {

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.