Package com.gpudb.protocol
Class SolveGraphRequest.Options
- java.lang.Object
-
- com.gpudb.protocol.SolveGraphRequest.Options
-
- Enclosing class:
- SolveGraphRequest
public static final class SolveGraphRequest.Options extends Object
-
-
Field Summary
Fields Modifier and Type Field Description static StringASTAREmploys A-STAR heuristics to speed up the shortest path traversalstatic StringASTAR_RADIUSFor path solvers only when 'solve_heuristic' option is 'astar'.static StringCONVERGENCE_LIMITForPAGE_RANKsolvers only; Maximum percent relative threshold on the page rank scores of each node between consecutive iterations to satisfy convergence.static StringFALSENo extra cluster info per node will be available in the outputstatic StringINTERSECTION_PENALTYThis will add an additional weight over the edges labeled as 'intersection' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation.static StringLEFT_TURN_PENALTYThis will add an additional weight over the edges labeled as 'left turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation.static StringMAX_ITERATIONSForPAGE_RANKsolvers only; Maximum number of page rank iterations for satisfying convergence.static StringMAX_NUM_COMBINATIONSForMULTIPLE_ROUTINGsolvers only; sets the cap on the combinatorial sequences generated.static StringMAX_RUNSFor allCENTRALITYsolvers only; Sets the maximum number of shortest path runs; maximum possible value is the number of nodes in the graph.static StringMAX_SOLUTION_RADIUSstatic StringMAX_SOLUTION_TARGETSstatic StringMIN_SOLUTION_RADIUSstatic StringNONENo heuristics are appliedstatic StringNUM_BEST_PATHSForMULTIPLE_ROUTINGsolvers only; sets the number of shortest paths computed from each node.static StringOUTPUT_CLUSTERSForSTATS_ALLsolvers only; the cluster index for each node will be inserted as an additional column in the output.static StringOUTPUT_EDGE_PATHIf true then concatenated edge IDs will be added as the EDGE path column of the solution table for each source and target pair in shortest path solves.static StringOUTPUT_WKT_PATHIf true then concatenated wkt line segments will be added as the Wktroute column of the solution table for each source and target pair in shortest path solves.static StringRIGHT_TURN_PENALTYThis will add an additional weight over the edges labeled as' right turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation.static StringSERVER_IDIndicates which graph server(s) to send the request to.static StringSHARP_TURN_PENALTYThis will add an additional weight over the edges labeled as 'sharp turn' or 'u-turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation.static StringSOLVE_HEURISTICSpecify heuristic search criterion only for the geo graphs and shortest path solves towards a single target.static StringTRUEAn additional column 'CLUSTER' will be added for each nodestatic StringUNIFORM_WEIGHTSWhen specified, assigns the given value to all the edges in the graph.
-
-
-
Field Detail
-
MAX_SOLUTION_RADIUS
public static final String MAX_SOLUTION_RADIUS
ForALLPATHS,SHORTEST_PATHandINVERSE_SHORTEST_PATHsolvers only. Sets the maximum solution cost radius, which ignores thedestinationNodeslist and instead outputs the nodes within the radius sorted by ascending cost. If set to '0.0', the setting is ignored. The default value is '0.0'.- See Also:
- Constant Field Values
-
MIN_SOLUTION_RADIUS
public static final String MIN_SOLUTION_RADIUS
ForALLPATHS,SHORTEST_PATHandINVERSE_SHORTEST_PATHsolvers only. Applicable only whenMAX_SOLUTION_RADIUSis set. Sets the minimum solution cost radius, which ignores thedestinationNodeslist and instead outputs the nodes within the radius sorted by ascending cost. If set to '0.0', the setting is ignored. The default value is '0.0'.- See Also:
- Constant Field Values
-
MAX_SOLUTION_TARGETS
public static final String MAX_SOLUTION_TARGETS
ForALLPATHS,SHORTEST_PATHandINVERSE_SHORTEST_PATHsolvers only. Sets the maximum number of solution targets, which ignores thedestinationNodeslist and instead outputs no more than n number of nodes sorted by ascending cost where n is equal to the setting value. If set to 0, the setting is ignored. The default value is '1000'.- See Also:
- Constant Field Values
-
UNIFORM_WEIGHTS
public static final String UNIFORM_WEIGHTS
When specified, assigns the given value to all the edges in the graph. Note that weights provided inweightsOnEdgeswill override this value.- See Also:
- Constant Field Values
-
LEFT_TURN_PENALTY
public static final String LEFT_TURN_PENALTY
This will add an additional weight over the edges labeled as 'left turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation. The default value is '0.0'.- See Also:
- Constant Field Values
-
RIGHT_TURN_PENALTY
public static final String RIGHT_TURN_PENALTY
This will add an additional weight over the edges labeled as' right turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation. The default value is '0.0'.- See Also:
- Constant Field Values
-
INTERSECTION_PENALTY
public static final String INTERSECTION_PENALTY
This will add an additional weight over the edges labeled as 'intersection' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation. The default value is '0.0'.- See Also:
- Constant Field Values
-
SHARP_TURN_PENALTY
public static final String SHARP_TURN_PENALTY
This will add an additional weight over the edges labeled as 'sharp turn' or 'u-turn' if the 'add_turn' option parameter of theGPUdb.createGraphwas invoked at graph creation. The default value is '0.0'.- See Also:
- Constant Field Values
-
NUM_BEST_PATHS
public static final String NUM_BEST_PATHS
ForMULTIPLE_ROUTINGsolvers only; sets the number of shortest paths computed from each node. This is the heuristic criterion. Default value of zero allows the number to be computed automatically by the solver. The user may want to override this parameter to speed-up the solver. The default value is '0'.- See Also:
- Constant Field Values
-
MAX_NUM_COMBINATIONS
public static final String MAX_NUM_COMBINATIONS
ForMULTIPLE_ROUTINGsolvers only; sets the cap on the combinatorial sequences generated. If the default value of two millions is overridden to a lesser value, it can potentially speed up the solver. The default value is '2000000'.- See Also:
- Constant Field Values
-
OUTPUT_EDGE_PATH
public static final String OUTPUT_EDGE_PATH
If true then concatenated edge IDs will be added as the EDGE path column of the solution table for each source and target pair in shortest path solves. Supported values: The default value isFALSE.- See Also:
- Constant Field Values
-
TRUE
public static final String TRUE
An additional column 'CLUSTER' will be added for each node- See Also:
- Constant Field Values
-
FALSE
public static final String FALSE
No extra cluster info per node will be available in the output- See Also:
- Constant Field Values
-
OUTPUT_WKT_PATH
public static final String OUTPUT_WKT_PATH
If true then concatenated wkt line segments will be added as the Wktroute column of the solution table for each source and target pair in shortest path solves. Supported values: The default value isTRUE.- See Also:
- Constant Field Values
-
SERVER_ID
public static final String SERVER_ID
Indicates which graph server(s) to send the request to. Default is to send to the server, amongst those containing the corresponding graph, that has the most computational bandwidth. For SHORTEST_PATH solver type, the input is split amongst the server containing the corresponding graph.- See Also:
- Constant Field Values
-
CONVERGENCE_LIMIT
public static final String CONVERGENCE_LIMIT
ForPAGE_RANKsolvers only; Maximum percent relative threshold on the page rank scores of each node between consecutive iterations to satisfy convergence. Default value is 1 (one) percent. The default value is '1.0'.- See Also:
- Constant Field Values
-
MAX_ITERATIONS
public static final String MAX_ITERATIONS
ForPAGE_RANKsolvers only; Maximum number of page rank iterations for satisfying convergence. Default value is 100. The default value is '100'.- See Also:
- Constant Field Values
-
MAX_RUNS
public static final String MAX_RUNS
For allCENTRALITYsolvers only; Sets the maximum number of shortest path runs; maximum possible value is the number of nodes in the graph. Default value of 0 enables this value to be auto computed by the solver. The default value is '0'.- See Also:
- Constant Field Values
-
OUTPUT_CLUSTERS
public static final String OUTPUT_CLUSTERS
ForSTATS_ALLsolvers only; the cluster index for each node will be inserted as an additional column in the output. Supported values:TRUE: An additional column 'CLUSTER' will be added for each nodeFALSE: No extra cluster info per node will be available in the output
FALSE.- See Also:
- Constant Field Values
-
SOLVE_HEURISTIC
public static final String SOLVE_HEURISTIC
Specify heuristic search criterion only for the geo graphs and shortest path solves towards a single target. Supported values:ASTAR: Employs A-STAR heuristics to speed up the shortest path traversalNONE: No heuristics are applied
NONE.- See Also:
- Constant Field Values
-
ASTAR
public static final String ASTAR
Employs A-STAR heuristics to speed up the shortest path traversal- See Also:
- Constant Field Values
-
NONE
public static final String NONE
No heuristics are applied- See Also:
- Constant Field Values
-
ASTAR_RADIUS
public static final String ASTAR_RADIUS
For path solvers only when 'solve_heuristic' option is 'astar'. The shortest path traversal front includes nodes only within this radius (kilometers) as it moves towards the target location. The default value is '70'.- See Also:
- Constant Field Values
-
-