7 using System.Collections.Generic;
502 public const string TRUE =
"true";
506 public const string FALSE =
"false";
596 public const string ASTAR =
"astar";
599 public const string NONE =
"none";
984 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
1366 IDictionary<string, string>
options = null)
1368 this.graph_name = graph_name ??
"";
1370 this.restrictions =
restrictions ??
new List<string>();
1372 this.source_nodes =
source_nodes ??
new List<string>();
1375 this.options =
options ??
new Dictionary<string, string>();
1398 public IDictionary<string, string>
info {
get; set; } =
new Dictionary<string, string>();
const string SOLVE_HEURISTIC
Specify heuristic search criterion only for the geo graphs and shortest path solves towards a single ...
IList< string > restrictions
Additional restrictions to apply to the nodes/edges of an existing graph.
const string PROBABILITY_RANK
Solves for the transitional probability (Hidden Markov) for each node based on the weights (probabili...
const string SHARP_TURN_PENALTY
This will add an additonal weight over the edges labelled as 'sharp turn' or 'u-turn' if the 'add_tur...
IList< string > source_nodes
It can be one of the nodal identifiers - e.g: 'NODE_WKTPOINT' for source nodes.
bool result
Indicates a successful solution on all servers.
const string SHORTEST_PATH
Solves for the optimal (shortest) path based on weights and restrictions from one source to destinati...
string solution_table
Name of the table to store the solution, in [schema_name.
const string STATS_ALL
Solves for graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc.
const string CLOSENESS
Solves for the centrality closeness score per node as the sum of the inverse shortest path costs to a...
const string MIN_SOLUTION_RADIUS
For ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers only.
const string INVERSE_SHORTEST_PATH
Solves for finding the optimal path cost for each destination node to route to the source node...
IDictionary< string, string > info
Additional information.
const string CONVERGENCE_LIMIT
For PAGE_RANK solvers only; Maximum percent relative threshold on the pagerank scores of each node be...
const string FALSE
No extra cluster info per node will be available in the output
string graph_name
Name of the graph resource to solve.
const string MAX_NUM_COMBINATIONS
For MULTIPLE_ROUTING solvers only; sets the cap on the combinatorial sequences generated.
SolveGraphRequest()
Constructs a SolveGraphRequest object with default parameters.
const string BACKHAUL_ROUTING
Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes...
const string ASTAR
Employs A-STAR heuristics to speed up the shortest path traversal
A set of parameters for Kinetica.solveGraph(string,IList{string},IList{string},string,IList{string},IList{string},string,IDictionary{string, string}).
const string SERVER_ID
Indicates which graph server(s) to send the request to.
const string MAX_ITERATIONS
For PAGE_RANK solvers only; Maximum number of pagerank iterations for satisfying convergence.
const string MAX_RUNS
For all CENTRALITY solvers only; Sets the maximum number of shortest path runs; maximum possible valu...
const string NONE
No heuristics are applied
SolveGraphRequest(string graph_name, IList< string > weights_on_edges=null, IList< string > restrictions=null, string solver_type=null, IList< string > source_nodes=null, IList< string > destination_nodes=null, string solution_table=null, IDictionary< string, string > options=null)
Constructs a SolveGraphRequest object with the specified parameters.
const string PAGE_RANK
Solves for the probability of each destination node being visited based on the links of the graph top...
const string OUTPUT_EDGE_PATH
If true then concatenated edge ids will be added as the EDGE path column of the solution table for ea...
const string UNIFORM_WEIGHTS
When specified, assigns the given value to all the edges in the graph.
const string MAX_SOLUTION_TARGETS
For ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers only.
const string OUTPUT_CLUSTERS
For STATS_ALL solvers only; the cluster index for each node will be inserted as an additional column ...
const string RIGHT_TURN_PENALTY
This will add an additonal weight over the edges labelled as' right turn' if the 'add_turn' option pa...
const string INTERSECTION_PENALTY
This will add an additonal weight over the edges labelled as 'intersection' if the 'add_turn' option ...
IList< string > weights_on_edges
Additional weights to apply to the edges of an existing graph.
string solver_type
The type of solver to use for the graph.
IList< float > result_per_destination_node
Cost or Pagerank (based on solver type) for each destination node requested.
IDictionary< string, string > options
Additional parameters MAX_SOLUTION_RADIUS: For ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solv...
const string OUTPUT_WKT_PATH
If true then concatenated wkt line segments will be added as the Wktroute column of the solution tabl...
A set of results returned by Kinetica.solveGraph(string,IList{string},IList{string},string,IList{string},IList{string},string,IDictionary{string, string}).
const string LEFT_TURN_PENALTY
This will add an additonal weight over the edges labelled as 'left turn' if the 'add_turn' option par...
const string CENTRALITY
Solves for the degree of a node to depict how many pairs of individuals that would have to go through...
const string ALLPATHS
Solves for paths that would give costs between max and min solution radia - Make sure to limit by the...
const string NUM_BEST_PATHS
For MULTIPLE_ROUTING solvers only; sets the number of shortest paths computed from each node...
const string MULTIPLE_ROUTING
Solves for finding the minimum cost cumulative path for a round-trip starting from the given source a...
KineticaData - class to help with Avro Encoding for Kinetica
The type of solver to use for the graph.
const string ASTAR_RADIUS
For path solvers only when 'solve_heuristic' option is 'astar'.
const string MAX_SOLUTION_RADIUS
For ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solvers only.
const string TRUE
An additional column 'CLUSTER' will be added for each node
IList< string > destination_nodes
It can be one of the nodal identifiers - e.g: 'NODE_WKTPOINT' for destination (target) nodes...
Additional parameters MAX_SOLUTION_RADIUS: For ALLPATHS, SHORTEST_PATH and INVERSE_SHORTEST_PATH solv...