public static final class VisualizeIsochroneRequest.Options extends Object
SOLVE_TABLE
: Name of the table to host intermediate solve results
containing the position and cost for each vertex in the graph. If the
default value is used, a temporary table is created and deleted once the
solution is calculated. The default value is ''.
IS_REPLICATED
: If set to true
, replicate the solve_table
.
Supported values:
The default value is TRUE
.
DATA_MIN_X
: Lower bound for the x values. If not provided, it will be
computed from the bounds of the input data.
DATA_MAX_X
: Upper bound for the x values. If not provided, it will be
computed from the bounds of the input data.
DATA_MIN_Y
: Lower bound for the y values. If not provided, it will be
computed from the bounds of the input data.
DATA_MAX_Y
: Upper bound for the y values. If not provided, it will be
computed from the bounds of the input data.
CONCAVITY_LEVEL
: Factor to qualify the concavity of the isochrone
curves. The lower the value, the more convex (with '0' being completely
convex and '1' being the most concave). The default value is '0.5'.
USE_PRIORITY_QUEUE_SOLVERS
: sets the solver methods explicitly if true
Supported values:
TRUE
: uses
the solvers scheduled for 'shortest_path' and 'inverse_shortest_path'
based on solve_direction
FALSE
: uses
the solvers 'priority_queue' and 'inverse_priority_queue' based on
solve_direction
FALSE
.
SOLVE_DIRECTION
: Specify whether we are going to the source node, or
starting from it.
Supported values:
FROM_SOURCE
: Shortest path to get to the source (inverse Dijkstra)
TO_SOURCE
: Shortest path to source (Dijkstra)
FROM_SOURCE
.
Map
.
A set of string constants for the parameter options
.Modifier and Type | Field and Description |
---|---|
static String |
CONCAVITY_LEVEL
Factor to qualify the concavity of the isochrone curves.
|
static String |
DATA_MAX_X
Upper bound for the x values.
|
static String |
DATA_MAX_Y
Upper bound for the y values.
|
static String |
DATA_MIN_X
Lower bound for the x values.
|
static String |
DATA_MIN_Y
Lower bound for the y values.
|
static String |
FALSE
uses the solvers 'priority_queue' and 'inverse_priority_queue' based
on solve_direction
|
static String |
FROM_SOURCE
Shortest path to get to the source (inverse Dijkstra)
|
static String |
IS_REPLICATED
If set to
true , replicate the solve_table . |
static String |
SOLVE_DIRECTION
Specify whether we are going to the source node, or starting from
it.
|
static String |
SOLVE_TABLE
Name of the table to host intermediate solve results containing the
position and cost for each vertex in the graph.
|
static String |
TO_SOURCE
Shortest path to source (Dijkstra)
|
static String |
TRUE
uses the solvers scheduled for 'shortest_path' and
'inverse_shortest_path' based on solve_direction
|
static String |
USE_PRIORITY_QUEUE_SOLVERS
|
public static final String SOLVE_TABLE
public static final String IS_REPLICATED
public static final String TRUE
public static final String FALSE
public static final String DATA_MIN_X
public static final String DATA_MAX_X
public static final String DATA_MIN_Y
public static final String DATA_MAX_Y
public static final String CONCAVITY_LEVEL
public static final String USE_PRIORITY_QUEUE_SOLVERS
TRUE
:
uses the solvers scheduled for 'shortest_path' and
'inverse_shortest_path' based on solve_direction
FALSE
:
uses the solvers 'priority_queue' and 'inverse_priority_queue' based
on solve_direction
FALSE
.public static final String SOLVE_DIRECTION
FROM_SOURCE
: Shortest path to get to the source (inverse Dijkstra)
TO_SOURCE
: Shortest path to source (Dijkstra)
FROM_SOURCE
.public static final String FROM_SOURCE
public static final String TO_SOURCE
Copyright © 2020. All rights reserved.