Index
All Classes and Interfaces|All Packages|Serialized Form
D
- DataIO - Class in rgu.transport.util
-
Methods for custom serialization code.
- DataIO() - Constructor for class rgu.transport.util.DataIO
- debugDump(File) - Method in class rgu.transport.geospatial.multimodal.TransitNetwork
-
Deprecated.
- decimalValue() - Method in class rgu.transport.geospatial.Latitude
-
Returns the latitude as a decimal to 7 decimal places.
- decimalValue() - Method in class rgu.transport.geospatial.Longitude
-
Returns the longitude as a decimal to 7 decimal places.
- decreaseKey(E, K) - Method in class rgu.transport.algorithms.collections.BinaryMinHeap
-
Replaces the key of the specified element with a specified smaller value.
- decreaseKey(E, K) - Method in interface rgu.transport.algorithms.collections.MinHeap
-
Replaces the key of the specified element with a specified smaller value.
- DEFAULT_CAR_SPEED - Static variable in class rgu.transport.geospatial.multimodal.TransitNetwork
- DEFAULT_WALK_SPEED - Static variable in class rgu.transport.geospatial.multimodal.TransitNetwork
- deleteEdges(Predicate) - Method in interface rgu.transport.algorithms.collections.Graph
-
Returns a graph which is equal to this graph but without the edges matching the specified predicate.
- deleteMinimum() - Method in class rgu.transport.algorithms.collections.BinaryMinHeap
-
Removes and returns the element with the minimum key.
- deleteMinimum() - Method in interface rgu.transport.algorithms.collections.MinHeap
-
Removes and returns the element with the minimum key.
- deleteVertices(Predicate) - Method in interface rgu.transport.algorithms.collections.Graph
-
Returns a graph which is equal to this graph but without the vertices matching the specified predicate.
- departureTime() - Method in class rgu.transport.geospatial.multimodal.Trip
-
Returns the departure time.
- destination() - Method in class rgu.transport.geospatial.multimodal.Trip
-
Returns the destination.
- Dijkstra<E> - Class in rgu.transport.algorithms.search
-
A thread-safe and generic implementation of Dijkstra's shortest path algorithm.
- Dijkstra(E, BinaryOperator, BiPredicate) - Constructor for class rgu.transport.algorithms.search.Dijkstra
-
Creates an instance of Dijkstra which works on the specified generic type of edges.
- distance() - Method in class rgu.transport.geospatial.osm.RoadEdge
- distance(T, T) - Method in interface rgu.transport.algorithms.search.Metric
-
Returns the distance between points a and b.
- Distance - Class in rgu.transport.geospatial
-
Represents a physical distance.
- done() - Method in interface rgu.transport.geospatial.multimodal.gtfs.GTFSProgressListener
-
Called when the loading process is over.
- done() - Method in interface rgu.transport.geospatial.osm.OSMProgressListener
- doubleValue() - Method in class rgu.transport.geospatial.Latitude
-
Returns the latitude as a double.
- doubleValue() - Method in class rgu.transport.geospatial.Longitude
-
Returns the longitude as a double.
- DurationAdapter - Class in rgu.transport.geospatial.osm
-
Adapts an instance of Graph<GeoLocation, RoadEdge> to Graph<GeoLocation, Duration> to use with an instance of RoutingAlgorithm<Duration> or ReachabilityAlgorithm<Duration>.
All Classes and Interfaces|All Packages|Serialized Form