public static final class SolveGraphRequest.Options extends Object
| Modifier and Type | Field and Description | 
|---|---|
| static String | ASTAREmploys A-STAR heuristics to speed up the shortest path traversal | 
| static String | ASTAR_RADIUSFor path solvers only when 'solve_heuristic' option is 'astar'. | 
| static String | CONVERGENCE_LIMITFor  PAGE_RANKsolvers only; Maximum
 percent relative threshold on the page rank scores of each node
 between consecutive iterations to satisfy convergence. | 
| static String | FALSENo extra cluster info per node will be available in the output | 
| static String | INTERSECTION_PENALTYThis will add an additional weight over the edges labeled as
 'intersection' if the 'add_turn' option parameter of the  GPUdb.createGraphwas invoked at graph creation. | 
| static String | LEFT_TURN_PENALTYThis will add an additional weight over the edges labeled as 'left
 turn' if the 'add_turn' option parameter of the  GPUdb.createGraphwas invoked at graph creation. | 
| static String | MAX_ITERATIONSFor  PAGE_RANKsolvers only; Maximum
 number of page rank iterations for satisfying convergence. | 
| static String | MAX_NUM_COMBINATIONSFor  MULTIPLE_ROUTINGsolvers
 only; sets the cap on the combinatorial sequences generated. | 
| static String | MAX_RUNSFor all  CENTRALITYsolvers only; Sets
 the maximum number of shortest path runs; maximum possible value is
 the number of nodes in the graph. | 
| static String | MAX_SOLUTION_RADIUS | 
| static String | MAX_SOLUTION_TARGETS | 
| static String | MIN_SOLUTION_RADIUS | 
| static String | NONENo heuristics are applied | 
| static String | NUM_BEST_PATHSFor  MULTIPLE_ROUTINGsolvers
 only; sets the number of shortest paths computed from each node. | 
| static String | OUTPUT_CLUSTERSFor  STATS_ALLsolvers only; the cluster
 index for each node will be inserted as an additional column in the
 output. | 
| static String | OUTPUT_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 String | OUTPUT_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 String | RIGHT_TURN_PENALTYThis will add an additional weight over the edges labeled as' right
 turn' if the 'add_turn' option parameter of the  GPUdb.createGraphwas invoked at graph creation. | 
| static String | SERVER_IDIndicates which graph server(s) to send the request to. | 
| static String | SHARP_TURN_PENALTYThis will add an additional weight over the edges labeled as 'sharp
 turn' or 'u-turn' if the 'add_turn' option parameter of the  GPUdb.createGraphwas invoked at graph creation. | 
| static String | SOLVE_HEURISTICSpecify heuristic search criterion only for the geo graphs and
 shortest path solves towards a single target. | 
| static String | TRUEAn additional column 'CLUSTER' will be added for each node | 
| static String | UNIFORM_WEIGHTSWhen specified, assigns the given value to all the edges in the
 graph. | 
public static final String MAX_SOLUTION_RADIUS
ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers
 only. Sets the maximum solution cost radius, which ignores the
 destinationNodes list 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'.public static final String MIN_SOLUTION_RADIUS
ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers
 only. Applicable only when MAX_SOLUTION_RADIUS is set. Sets the minimum solution cost radius,
 which ignores the destinationNodes
 list 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'.public static final String MAX_SOLUTION_TARGETS
ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers
 only. Sets the maximum number of solution targets, which ignores the
 destinationNodes list 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'.public static final String UNIFORM_WEIGHTS
weightsOnEdges will override this value.public static final String LEFT_TURN_PENALTY
GPUdb.createGraph
 was invoked at graph creation. The default value is '0.0'.public static final String RIGHT_TURN_PENALTY
GPUdb.createGraph
 was invoked at graph creation. The default value is '0.0'.public static final String INTERSECTION_PENALTY
GPUdb.createGraph
 was invoked at graph creation. The default value is '0.0'.public static final String SHARP_TURN_PENALTY
GPUdb.createGraph
 was invoked at graph creation. The default value is '0.0'.public static final String NUM_BEST_PATHS
MULTIPLE_ROUTING solvers
 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'.public static final String MAX_NUM_COMBINATIONS
MULTIPLE_ROUTING solvers
 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'.public static final String OUTPUT_EDGE_PATH
FALSE.public static final String TRUE
public static final String FALSE
public static final String OUTPUT_WKT_PATH
TRUE.public static final String SERVER_ID
public static final String CONVERGENCE_LIMIT
PAGE_RANK solvers 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'.public static final String MAX_ITERATIONS
PAGE_RANK solvers only; Maximum
 number of page rank iterations for satisfying convergence. Default
 value is 100. The default value is '100'.public static final String MAX_RUNS
CENTRALITY solvers 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'.public static final String OUTPUT_CLUSTERS
STATS_ALL solvers 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 node
     FALSE: No extra cluster info per node
         will be available in the output
 FALSE.public static final String SOLVE_HEURISTIC
ASTAR: Employs A-STAR heuristics to
         speed up the shortest path traversal
     NONE: No heuristics are applied
 NONE.public static final String ASTAR
public static final String NONE
public static final String ASTAR_RADIUS
Copyright © 2025. All rights reserved.