7 using System.Collections.Generic;
54 public const string TRUE =
"true";
55 public const string FALSE =
"false";
337 public const string MIN_X =
"min_x";
341 public const string MAX_X =
"max_x";
345 public const string MIN_Y =
"min_y";
349 public const string MAX_Y =
"max_y";
368 public const string TRUE =
"true";
369 public const string FALSE =
"false";
586 public IList<string>
nodes {
get; set; } =
new List<string>();
604 public IList<string>
edges {
get; set; } =
new List<string>();
624 public IList<string>
weights {
get; set; } =
new List<string>();
902 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
1260 IList<string>
nodes,
1261 IList<string>
edges,
1264 IDictionary<string, string>
options = null)
1266 this.graph_name = graph_name ??
"";
1267 this.directed_graph = directed_graph ??
true;
1268 this.nodes = nodes ??
new List<string>();
1269 this.edges = edges ??
new List<string>();
1270 this.weights = weights ??
new List<string>();
1271 this.restrictions = restrictions ??
new List<string>();
1272 this.options =
options ??
new Dictionary<string, string>();
1293 public IList<long>
edges_ids {
get; set; } =
new List<long>();
1296 public IDictionary<string, string>
info {
get; set; } =
new Dictionary<string, string>();
IDictionary< string, string > info
Additional information.
long num_edges
Total number of edges created.
const string EXPORT_CREATE_RESULTS
If set to true, returns the graph topology in the response as arrays.
const string MIN_Y
Minimum y (latitude) value for spatial graph associations.
IList< string > weights
Weights represent a method of informing the graph solver of the cost of including a given edge in a s...
IList< long > edges_ids
Edges given as pairs of node indices.
const string ADD_TURNS
Adds dummy 'pillowed' edges around intersection nodes where there are more than three edges so that a...
If set to true, the graph will be directed.
CreateGraphRequest(string graph_name, bool?directed_graph, IList< string > nodes, IList< string > edges, IList< string > weights, IList< string > restrictions, IDictionary< string, string > options=null)
Constructs a CreateGraphRequest object with the specified parameters.
const string SYNC_DB
If set to true and save_persist is set to true, the graph will be fully reconstructed upon a database...
const string MIN_X
Minimum x (longitude) value for spatial graph associations.
long num_nodes
Total number of nodes created.
const string REMOVE_LABEL_ONLY
When RESTRICTIONS on labeled entities requested, if set to true this will NOT delete the entity but o...
const string RECREATE
If set to true and the graph (using graph_name) already exists, the graph is deleted and recreated...
IList< string > nodes
Nodes represent fundamental topological units of a graph.
const string TURN_ANGLE
Value in degrees modifies the thresholds for attributing right, left, sharp turns, and intersections.
CreateGraphRequest()
Constructs a CreateGraphRequest object with default parameters.
A set of parameters for Kinetica.createGraph(string,bool,IList{string},IList{string},IList{string},IList{string},IDictionary{string, string}).
IDictionary< string, string > options
Optional parameters.
const string RESTRICTION_THRESHOLD_VALUE
Value-based restriction comparison.
string graph_name
Name of the graph resource to generate.
const string MAX_Y
Maximum y (latitude) value for spatial graph associations.
A set of results returned by Kinetica.createGraph(string,bool,IList{string},IList{string},IList{string},IList{string},IDictionary{string, string}).
const string MERGE_TOLERANCE
If node geospatial positions are input (e.g., WKTPOINT, X, Y), determines the minimum separation allo...
const string MODIFY
If set to true, recreate is set to true, and the graph (specified using graph_name) already exists...
const string GRAPH_TABLE
If specified, the created graph is also created as a table with the given name and following identifi...
const string SAVE_PERSIST
If set to true, the graph will be saved in the persist directory (see the config reference for more i...
IList< string > edges
Edges represent the required fundamental topological unit of a graph that typically connect nodes...
const string ADD_TABLE_MONITOR
Adds a table monitor to every table used in the creation of the graph; this table monitor will trigge...
const string MAX_X
Maximum x (longitude) value for spatial graph associations.
KineticaData - class to help with Avro Encoding for Kinetica
const string ENABLE_GRAPH_DRAW
If set to true, adds a 'EDGE_WKTLINE' column identifier to the specified graph_table so the graph can...
bool directed_graph
If set to true, the graph will be directed.
IList< string > restrictions
Restrictions represent a method of informing the graph solver which edges and/or nodes should be igno...