SolveGraph.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 SolveGraphRequest : KineticaData
{
    public struct SolverType
    {
        public const string SHORTEST_PATH = "SHORTEST_PATH";

        public const string PAGE_RANK = "PAGE_RANK";

        public const string PROBABILITY_RANK = "PROBABILITY_RANK";

        public const string CENTRALITY = "CENTRALITY";

        public const string MULTIPLE_ROUTING = "MULTIPLE_ROUTING";

        public const string INVERSE_SHORTEST_PATH = "INVERSE_SHORTEST_PATH";

        public const string BACKHAUL_ROUTING = "BACKHAUL_ROUTING";

        public const string ALLPATHS = "ALLPATHS";

        public const string STATS_ALL = "STATS_ALL";

        public const string CLOSENESS = "CLOSENESS";
    } // end struct SolverType

    public struct Options
    {
        public const string MAX_SOLUTION_RADIUS = "max_solution_radius";

        public const string MIN_SOLUTION_RADIUS = "min_solution_radius";

        public const string MAX_SOLUTION_TARGETS = "max_solution_targets";

        public const string UNIFORM_WEIGHTS = "uniform_weights";

        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 NUM_BEST_PATHS = "num_best_paths";

        public const string MAX_NUM_COMBINATIONS = "max_num_combinations";

        public const string OUTPUT_EDGE_PATH = "output_edge_path";

        public const string TRUE = "true";

        public const string FALSE = "false";

        public const string OUTPUT_WKT_PATH = "output_wkt_path";

        public const string SERVER_ID = "server_id";

        public const string CONVERGENCE_LIMIT = "convergence_limit";

        public const string MAX_ITERATIONS = "max_iterations";

        public const string MAX_RUNS = "max_runs";

        public const string OUTPUT_CLUSTERS = "output_clusters";

        public const string SOLVE_HEURISTIC = "solve_heuristic";

        public const string ASTAR = "astar";

        public const string NONE = "none";

        public const string ASTAR_RADIUS = "astar_radius";
    } // end struct Options

    public string graph_name { get; set; }

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

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

    public string solver_type { get; set; } = SolverType.SHORTEST_PATH;

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

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

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

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

    public SolveGraphRequest() { }

    public 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)
    {
        this.graph_name = graph_name ?? "";
        this.weights_on_edges = weights_on_edges ?? new List<string>();
        this.restrictions = restrictions ?? new List<string>();
        this.solver_type = solver_type ?? SolverType.SHORTEST_PATH;
        this.source_nodes = source_nodes ?? new List<string>();
        this.destination_nodes = destination_nodes ?? new List<string>();
        this.solution_table = solution_table ?? "graph_solutions";
        this.options = options ?? new Dictionary<string, string>();
    } // end constructor
} // end class SolveGraphRequest

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

    public IList<float> result_per_destination_node { get; set; } = new List<float>();

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