7 using System.Collections.Generic;
394 public const string TRUE =
"true";
398 public const string FALSE =
"false";
822 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
1127 IDictionary<string, string>
options = null)
1129 this.graph_name = graph_name ??
"";
1130 this.sample_points = sample_points ??
new List<string>();
1133 this.options =
options ??
new Dictionary<string, string>();
1154 public IDictionary<string, string>
info {
get; set; } =
new Dictionary<string, string>();
Additional parameters GPS_NOISE: GPS noise value (in meters) to remove redundant sample points...
const string SOURCE
Optional WKT starting point from sample_points for the solver.
const string TRUCK_SERVICE_LIMIT
For the match_supply_demand solver only.
const string AGGREGATED_OUTPUT
For the match_supply_demand solver only.
const string SEARCH_RADIUS
Maximum search radius used when snapping sample points onto potentially matching surrounding segments...
const string PARTIAL_LOADING
For the match_supply_demand solver only.
string solution_table
The name of the table used to store the results; this table contains a track of geospatial points for...
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...
const string NUM_SEGMENTS
Maximum number of potentially matching road segments for each sample point.
const string INTERSECTION_PENALTY
This will add an additonal weight over the edges labelled as 'intersection' if the 'add_turn' option ...
const string CHAIN_WIDTH
For the markov_chain solver only.
const string MARKOV_CHAIN
Matches sample_points to the graph using the Hidden Markov Model (HMM)-based method, which conducts a range-tree closest-edge search to find the best combinations of possible road segments (num_segments) for each sample point to create the best route.
const string TRUE
Allows reusing trucks for scheduling again.
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 MATCH_OD_PAIRS
Matches sample_points to find the most probable path between origin and destination pairs with cost c...
IDictionary< string, string > info
Additional information.
IDictionary< string, string > options
Additional parameters GPS_NOISE: GPS noise value (in meters) to remove redundant sample points...
A set of results returned by Kinetica.matchGraph(string,IList{string},string,string,IDictionary{string, string}).
const string MAX_NUM_THREADS
For the markov_chain solver only.
const string MAX_COMBINATIONS
For the match_supply_demand solver only.
const string ENABLE_TRUCK_REUSE
For the match_supply_demand solver only.
float match_score
The mean square error calculation representing the map matching score.
const string FILTER_FOLDING_PATHS
For the markov_chain solver only.
const string MATCH_BATCH_SOLVES
Matches sample_points source and destination pairs for the shortest path solves in batch mode...
The type of solver to use for graph matching.
const string UNIT_UNLOADING_COST
For the match_supply_demand solver only.
bool result
Indicates a successful solution.
const string MATCH_SUPPLY_DEMAND
Matches sample_points to optimize scheduling multiple supplies (trucks) with varying sizes to varying...
string solve_method
The type of solver to use for graph matching.
const string FALSE
Trucks are scheduled only once from their depots.
const string MAX_TRIP_COST
For the match_supply_demand solver only.
A set of parameters for Kinetica.matchGraph(string,IList{string},string,string,IDictionary{string, string}).
const string DESTINATION
Optional WKT ending point from sample_points for the solver.
KineticaData - class to help with Avro Encoding for Kinetica
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 GPS_NOISE
GPS noise value (in meters) to remove redundant sample points.
string graph_name
Name of the underlying geospatial graph resource to match to using .
IList< string > sample_points
Sample points used to match to an underlying geospatial graph.
MatchGraphRequest()
Constructs a MatchGraphRequest object with default parameters.
MatchGraphRequest(string graph_name, IList< string > sample_points, string solve_method=null, string solution_table=null, IDictionary< string, string > options=null)
Constructs a MatchGraphRequest object with the specified parameters.