Uses of Interface
rgu.transport.algorithms.collections.Explorable

Packages that use Explorable
Package
Description
rgu.transport.algorithms.collections
Contains data structures used by algorithms.
rgu.transport.algorithms.search
Contains algorithms for search such as Dijkstra graph search.

  • Uses of Explorable in rgu.transport.algorithms.collections

    Subinterfaces of Explorable in rgu.transport.algorithms.collections
    Modifier and Type
    Interface
    Description
    interface 
    Graph<V,E>
    A mathematical graph.
    Classes in rgu.transport.algorithms.collections that implement Explorable
    Modifier and Type
    Class
    Description
    final class 
    HashGraph<V,E>
    A mathematical graph which uses an underling hashed representation of vertices.

  • Uses of Explorable in rgu.transport.algorithms.search

    Methods in rgu.transport.algorithms.search with parameters of type Explorable
    Modifier and Type
    Method
    Description
    static <T,C> CostMatrix<T,C>
    CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm)
    Constructs a cost matrix by searching the specified graph.
    static <T,C> CostMatrix<T,C>
    CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm, ProgressListener progress)
    Constructs a cost matrix by searching the specified graph.
    static <T,C> CostMatrix<T,C>
    CostMatrix.construct(Explorable<T,C> graph, Set<T> vertices, ReachabilityAlgorithm<C> algorithm, ProgressListener progress, boolean subStageOnly)
    Constructs a cost matrix by searching the specified graph.
    <V> E
    Dijkstra.cost(Explorable<V,E> graph, List<V> path)
    Reconstructs the total cost of a given path.
    <V> E
    RoutingAlgorithm.cost(Explorable<V,E> graph, List<V> path)
    Reconstructs the total cost of a given path.
    <V> List<V>
    Dijkstra.path(Explorable<V,E> graph, V source, Predicate<V> target)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
    <V> List<V>
    Dijkstra.path(Explorable<V,E> graph, V source, Predicate<V> target, E maxCost)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
    <V> List<V>
    Dijkstra.path(Explorable<V,E> graph, V source, V target)
    Finds a route from the specified source to the specified target.
    <V> List<V>
    Dijkstra.path(Explorable<V,E> graph, V source, V target, E maxCost)
    Finds a route from the specified source to the specified target within a given maximum cost.
    <V> List<V>
    RoutingAlgorithm.path(Explorable<V,E> graph, V source, Predicate<V> target)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
    <V> List<V>
    RoutingAlgorithm.path(Explorable<V,E> graph, V source, Predicate<V> target, E maxCost)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
    <V> List<V>
    RoutingAlgorithm.path(Explorable<V,E> graph, V source, V target)
    Finds a route from the specified source to the specified target.
    <V> List<V>
    RoutingAlgorithm.path(Explorable<V,E> graph, V source, V target, E maxCost)
    Finds a route from the specified source to the specified target within a given maximum cost.
    <V> Map<V,E>
    Dijkstra.reachable(Explorable<V,E> graph, V source)
    Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <V> Map<V,E>
    Dijkstra.reachable(Explorable<V,E> graph, V source, E maxCost)
    Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <V> void
    Dijkstra.reachable(Explorable<V,E> graph, V source, E maxCost, ReachabilityCallback<V,E> callback)
    Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <V> void
    Dijkstra.reachable(Explorable<V,E> graph, V source, ReachabilityCallback<V,E> callback)
    Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <V> Map<V,E>
    ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source)
    Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <V> Map<V,E>
    ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source, E maxCost)
    Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <V> void
    ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source, E maxCost, ReachabilityCallback<V,E> callback)
    Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <V> void
    ReachabilityAlgorithm.reachable(Explorable<V,E> graph, V source, ReachabilityCallback<V,E> callback)
    Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <ST,S> List<ST>
    Dijkstra.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
    <ST,S> List<ST>
    Dijkstra.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
    <ST,S> List<ST>
    Dijkstra.stPath(Explorable<ST,E> graph, ST source, ST target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target within a given maximum cost.
    <ST,S> List<ST>
    Dijkstra.stPath(Explorable<ST,E> graph, ST source, ST target, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target.
    <ST,S> List<ST>
    SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target, within a given maximum cost.
    <ST,S> List<ST>
    SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, Predicate<ST> target, SpatialTemporalMapping<S,E,ST> stMapping)
    Finds a route from the specified source to the specified target(s) by predicate which returns true if a given vertex is a target.
    <ST,S> List<ST>
    SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, ST target, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Deprecated, for removal: This API element is subject to removal in a future version.
    <ST,S> List<ST>
    SpatialTemporalRoutingAlgorithm.stPath(Explorable<ST,E> graph, ST source, ST target, SpatialTemporalMapping<S,E,ST> stMapping)
    Deprecated, for removal: This API element is subject to removal in a future version.
    <ST,S> void
    Dijkstra.stReachable(Explorable<ST,E> graph, ST source, E maxCost, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)
    Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <ST,S> Map<ST,E>
    Dijkstra.stReachable(Explorable<ST,E> graph, ST source, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <ST,S> void
    Dijkstra.stReachable(Explorable<ST,E> graph, ST source, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)
    Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <ST,S> Map<ST,E>
    Dijkstra.stReachable(Explorable<ST,E> graph, ST source, SpatialTemporalMapping<S,E,ST> stMapping)
    Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <ST,S> void
    SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, E maxCost, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)
    Streams to a callback function the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <ST,S> Map<ST,E>
    SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, E maxCost, SpatialTemporalMapping<S,E,ST> stMapping)
    Returns the set of vertices reachable within a given maximum cost, and the corresponding cost of each vertex's shortest path.
    <ST,S> void
    SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, ReachabilityCallback<ST,E> callback, SpatialTemporalMapping<S,E,ST> stMapping)
    Streams to a callback function the set of reachable vertices and the corresponding cost of each vertex's shortest path.
    <ST,S> Map<ST,E>
    SpatialTemporalReachabilityAlgorithm.stReachable(Explorable<ST,E> graph, ST source, SpatialTemporalMapping<S,E,ST> stMapping)
    Returns the set of reachable vertices and the corresponding cost of each vertex's shortest path.