MatchGraph.cs

Go to the documentation of this file.

/*
 *  This file was autogenerated by the Kinetica schema processor.
 *
 *  DO NOT EDIT DIRECTLY.
 */

using System.Collections.Generic;

namespace kinetica
{
    public class MatchGraphRequest : KineticaData
    {
        public struct SolveMethod
        {
            public const string MARKOV_CHAIN = "markov_chain";

            public const string MATCH_OD_PAIRS = "match_od_pairs";

            public const string MATCH_SUPPLY_DEMAND = "match_supply_demand";

            public const string MATCH_BATCH_SOLVES = "match_batch_solves";

            public const string MATCH_LOOPS = "match_loops";

            public const string MATCH_CHARGING_STATIONS = "match_charging_stations";

            public const string MATCH_SIMILARITY = "match_similarity";

            public const string MATCH_PICKUP_DROPOFF = "match_pickup_dropoff";

            public const string MATCH_CLUSTERS = "match_clusters";

            public const string MATCH_PATTERN = "match_pattern";

            public const string MATCH_EMBEDDING = "match_embedding";

            public const string MATCH_ISOCHRONE = "match_isochrone";
        } // end struct SolveMethod

        public struct Options
        {
            public const string GPS_NOISE = "gps_noise";

            public const string NUM_SEGMENTS = "num_segments";

            public const string SEARCH_RADIUS = "search_radius";

            public const string CHAIN_WIDTH = "chain_width";

            public const string SOURCE = "source";

            public const string DESTINATION = "destination";

            public const string PARTIAL_LOADING = "partial_loading";

            public const string TRUE = "true";
            public const string FALSE = "false";

            public const string MAX_COMBINATIONS = "max_combinations";

            public const string MAX_SUPPLY_COMBINATIONS = "max_supply_combinations";

            public const string LEFT_TURN_PENALTY = "left_turn_penalty";

            public const string RIGHT_TURN_PENALTY = "right_turn_penalty";

            public const string INTERSECTION_PENALTY = "intersection_penalty";

            public const string SHARP_TURN_PENALTY = "sharp_turn_penalty";

            public const string AGGREGATED_OUTPUT = "aggregated_output";

            public const string OUTPUT_TRACKS = "output_tracks";

            public const string MAX_TRIP_COST = "max_trip_cost";

            public const string FILTER_FOLDING_PATHS = "filter_folding_paths";

            public const string UNIT_UNLOADING_COST = "unit_unloading_cost";

            public const string MAX_NUM_THREADS = "max_num_threads";

            public const string SERVICE_LIMIT = "service_limit";

            public const string ENABLE_REUSE = "enable_reuse";

            public const string MAX_STOPS = "max_stops";

            public const string SERVICE_RADIUS = "service_radius";

            public const string PERMUTE_SUPPLIES = "permute_supplies";

            public const string BATCH_TSM_MODE = "batch_tsm_mode";

            public const string ROUND_TRIP = "round_trip";

            public const string NUM_CYCLES = "num_cycles";

            public const string NUM_LOOPS_PER_CYCLE = "num_loops_per_cycle";

            public const string NUM_OUTPUT_CLUSTERS = "num_output_clusters";

            public const string MAX_NUM_CLUSTERS = "max_num_clusters";

            public const string CLUSTER_QUALITY_METRIC = "cluster_quality_metric";

            public const string GIRVAN = "girvan";

            public const string SPECTRAL = "spectral";

            public const string RESTRICTED_TYPE = "restricted_type";

            public const string ODD = "odd";

            public const string EVEN = "even";

            public const string NONE = "none";

            public const string SERVER_ID = "server_id";

            public const string INVERSE_SOLVE = "inverse_solve";

            public const string MIN_LOOP_LEVEL = "min_loop_level";

            public const string MAX_LOOP_LEVEL = "max_loop_level";

            public const string SEARCH_LIMIT = "search_limit";

            public const string OUTPUT_BATCH_SIZE = "output_batch_size";

            public const string CHARGING_CAPACITY = "charging_capacity";

            public const string CHARGING_CANDIDATES = "charging_candidates";

            public const string CHARGING_PENALTY = "charging_penalty";

            public const string MAX_HOPS = "max_hops";

            public const string TRAVERSAL_NODE_LIMIT = "traversal_node_limit";

            public const string PAIRED_SIMILARITY = "paired_similarity";

            public const string FORCE_UNDIRECTED = "force_undirected";

            public const string MAX_VECTOR_DIMENSION = "max_vector_dimension";

            public const string OPTIMIZE_EMBEDDING_WEIGHTS = "optimize_embedding_weights";

            public const string EMBEDDING_WEIGHTS = "embedding_weights";

            public const string OPTIMIZATION_SAMPLING_SIZE = "optimization_sampling_size";

            public const string OPTIMIZATION_MAX_ITERATIONS = "optimization_max_iterations";

            public const string OPTIMIZATION_ERROR_TOLERANCE = "optimization_error_tolerance";

            public const string OPTIMIZATION_ITERATION_RATE = "optimization_iteration_rate";

            public const string MAX_RADIUS = "max_radius";
        } // end struct Options

        public string graph_name { get; set; }

        public IList<string> sample_points { get; set; } = new List<string>();

        public string solve_method { get; set; } = SolveMethod.MARKOV_CHAIN;

        public string solution_table { get; set; } = "";

        public IDictionary<string, string> options { get; set; } = new Dictionary<string, string>();

        public MatchGraphRequest() { }

        public MatchGraphRequest( string graph_name,
                                  IList<string> sample_points,
                                  string solve_method = null,
                                  string solution_table = null,
                                  IDictionary<string, string> options = null)
        {
            this.graph_name = graph_name ?? "";
            this.sample_points = sample_points ?? new List<string>();
            this.solve_method = solve_method ?? SolveMethod.MARKOV_CHAIN;
            this.solution_table = solution_table ?? "";
            this.options = options ?? new Dictionary<string, string>();
        } // end constructor
    } // end class MatchGraphRequest

    public class MatchGraphResponse : KineticaData
    {
        public bool result { get; set; }

        public float match_score { get; set; }

        public IDictionary<string, string> info { get; set; } = new Dictionary<string, string>();
    } // end class MatchGraphResponse
} // end namespace kinetica