Examples of ShortestPathTree

org.opentripplanner.routing.spt.ShortestPathTree

An interface for classes that track which graph vertices are visited and their associated states, so that decisions can be made about whether new states should be enqueued for later exploration. It also allows states to be retrieved for a given target vertex. Different implementations of this interface allow the routing algorithm to switch from a basic Dijkstra search (which is sufficient for non-time-dependent modes e.g. bicycle) and the more complex label-setting approaches needed for time-dependent public transit routing. @author andrewbyrd

        Vertex stop_d = graph.getVertex("agency:D");
        Vertex stop_c = graph.getVertex("agency:C");
        RoutingRequest options = new RoutingRequest();
        options.dateTime = TestUtils.dateInSeconds("America/New_York", 2009, 8, 1, 10, 0, 0);
        options.setRoutingContext(graph, stop_d, stop_c);
        ShortestPathTree spt = aStar.getShortestPathTree(options);


        GraphPath path = spt.getPath(stop_c, false);
        assertNotNull(path);
        assertEquals(TestUtils.dateInSeconds("America/New_York", 2009, 8, 1, 11, 0, 0), path.getEndTime());
    }

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.

Examples of ShortestPathTree

Examples of org.opentripplanner.routing.spt.ShortestPathTree