Package org.matsim.core.router.util
-
Interface Summary Interface Description Landmarker LeastCostPathCalculator LeastCostPathCalculatorFactory Example(s):tutorial.programming.example21tutorialTUBclass.leastCostPath.RunLeastCostPathCalculatorExample
LinkToLinkTravelTime Interface for travel time queries that include the link travel time and the time needed for the turning move.NodeData NodeDataFactory RoutingNetwork A network that is used by FastDijkstra, FastAStarEuclidean and FastAStarLandmarks.RoutingNetworkFactory RoutingNetworkLink RoutingNetworkNode TravelDisutility A simple interface to retrieve the disutility to travel on links.TravelTime A simple interface to retrieve the travel time on links. -
Class Summary Class Description AbstractRoutingNetwork AbstractRoutingNetworkFactory AbstractRoutingNetworkLink AbstractRoutingNetworkNode ArrayRoutingNetwork ArrayRoutingNetworkFactory ArrayRoutingNetworkLink ArrayRoutingNetworkNode AStarNodeData Holds AStarEuclidean specific information used during routing associated with each node in the network.AStarNodeDataFactory DijkstraNodeData A data structure to store temporarily information used by the Dijkstra-algorithm.DijkstraNodeDataFactory LeastCostPathCalculator.Path PieSlicesLandmarker PreProcessDijkstra Pre-processes a given network, gathering information which can be used by a Dijkstra when computing least-cost paths between a start and an end node.PreProcessDijkstra.DeadEndData Contains information whether the associated node is in a dead end.PreProcessEuclidean Pre-processes a given network, gathering information which can be used by a AStarEuclidean when computing least-cost paths between a start and an end node.PreProcessLandmarks Pre-processes a given network, gathering information which can be used byAStarLandmarks
when computing least-cost paths between a start and an end node.PreProcessLandmarks.LandmarksData TravelDisutilityUtils TravelTimeUtils