7 using System.Collections.Generic;
795 public const string TRUE =
"true";
796 public const string FALSE =
"false";
1110 public const string ODD =
"odd";
1914 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
2601 IDictionary<string, string>
options = null)
2603 this.graph_name = graph_name ??
"";
2604 this.sample_points = sample_points ??
new List<string>();
2607 this.options =
options ??
new Dictionary<string, string>();
2628 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 CHARGING_PENALTY
For the match_charging_stations solver only.
const string MAX_HOPS
For the match_similarity 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 MAX_SUPPLY_COMBINATIONS
For the match_supply_demand solver only.
const string PARTIAL_LOADING
For the match_supply_demand solver only.
string solution_table
The name of the table used to store the results, in [schema_name.
const string MAX_STOPS
For the match_supply_demand solver only.
const string ODD
Applies odd/even rule restrictions to odd tagged vehicles.
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 MATCH_PICKUP_DROPOFF
Matches the pickups and dropoffs by optimizing the total trip costs
const string OUTPUT_TRACKS
For the match_supply_demand solver only.
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 NUM_CYCLES
For the match_clusters solver only.
const string CHARGING_CAPACITY
For the match_charging_stations 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 MATCH_CLUSTERS
Matches the graph nodes with a cluster index using Louvain clustering algorithm
const string ROUND_TRIP
For the match_supply_demand solver only.
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 SERVICE_LIMIT
For the match_supply_demand solver only.
const string MIN_LOOP_LEVEL
For the match_loops solver only.
const string EVEN
Applies odd/even rule restrictions to even tagged vehicles.
const string MAX_NUM_CLUSTERS
For the match_clusters solver only.
const string TRAVERSAL_NODE_LIMIT
For the match_similarity solver only.
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.
const string MATCH_LOOPS
Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max ho...
const string NUM_LOOPS_PER_CYCLE
For the match_clusters solver only.
const string MATCH_PATTERN
Matches a pattern in the graph
const string SPECTRAL
Applies recursive spectral bisection (RSB) partitioning solver
IDictionary< string, string > options
Additional parameters GPS_NOISE: GPS noise value (in meters) to remove redundant sample points...
const string OUTPUT_BATCH_SIZE
For the match_loops solver only.
const string SERVICE_RADIUS
For the match_supply_demand and match_pickup_dropoff solvers only.
const string PAIRED_SIMILARITY
For the match_similarity solver only.
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 SERVER_ID
Indicates which graph server(s) to send the request to.
const string SEARCH_LIMIT
For the match_loops solver only.
const string MAX_COMBINATIONS
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 INVERSE_SOLVE
For the match_batch_solves 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 CLUSTER_QUALITY_METRIC
For the match_clusters solver only.
const string BATCH_TSM_MODE
For the match_supply_demand solver only.
const string UNIT_UNLOADING_COST
For the match_supply_demand solver only.
const string PERMUTE_SUPPLIES
For the match_supply_demand solver only.
const string RESTRICTED_TYPE
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...
const string FORCE_UNDIRECTED
For the match_pattern solver only.
string solve_method
The type of solver to use for graph matching.
const string MATCH_SIMILARITY
Matches the intersection set(s) by computing the Jaccard similarity score between node pairs...
const string MAX_TRIP_COST
For the match_supply_demand and match_pickup_dropoff solvers only.
A set of parameters for Kinetica.matchGraph(string,IList{string},string,string,IDictionary{string, string}).
const string MATCH_CHARGING_STATIONS
Matches an optimal path across a number of ev-charging stations between source and target locations...
const string NONE
Does not apply odd/even rule restrictions to any vehicles.
const string DESTINATION
Optional WKT ending point from sample_points for the solver.
const string CHARGING_CANDIDATES
For the match_charging_stations solver only.
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.
const string MAX_LOOP_LEVEL
For the match_loops solver only.
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.
const string NUM_OUTPUT_CLUSTERS
For the match_clusters solver only.
const string ENABLE_REUSE
For the match_supply_demand solver only.
const string GIRVAN
Uses the Newman Girvan quality metric for cluster solver
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.