7 using System.Collections.Generic;
54 public const string TRUE =
"true";
55 public const string FALSE =
"false";
275 public const string TRUE =
"true";
276 public const string FALSE =
"false";
456 public IList<string>
nodes {
get; set; } =
new List<string>();
474 public IList<string>
edges {
get; set; } =
new List<string>();
494 public IList<string>
weights {
get; set; } =
new List<string>();
701 public IDictionary<string, string>
options {
get; set; } =
new Dictionary<string, string>();
992 IDictionary<string, string>
options = null)
994 this.graph_name = graph_name ??
"";
995 this.directed_graph = directed_graph ??
true;
996 this.nodes = nodes ??
new List<string>();
997 this.edges = edges ??
new List<string>();
998 this.weights = weights ??
new List<string>();
999 this.restrictions = restrictions ??
new List<string>();
1000 this.options =
options ??
new Dictionary<string, string>();
1026 public IList<long>
edges_ids {
get; set; } =
new List<long>();
1029 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.
IList< string > weights
Weights represent a method of informing the graph solver of the cost of including a given edge in a s...
const string ALLOW_MULTIPLE_EDGES
Multigraph choice; allowing multiple edges with the same node pairs if set to true, otherwise, new edges with existing same node pairs will not be inserted.
IList< long > edges_ids
[Deprecated] 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.
long num_nodes
Total number of nodes created.
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.
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.
string graph_name
Name of the graph resource to generate.
const string LABEL_DELIMITER
If provided the label string will be split according to this delimiter and each sub-string will be ap...
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 GRAPH_TABLE
If specified, the created graph is also created as a table with the given name, in [schema_name...
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...
bool result
Indicates a successful creation on all servers.
const string ADD_TABLE_MONITOR
Adds a table monitor to every table used in the creation of the graph; this table monitor will trigge...
KineticaData - class to help with Avro Encoding for Kinetica
const string IS_PARTITIONED
Supported values: TRUE FALSE The default value is FALSE.
const string USE_RTREE
Use an range tree structure to accelerate and improve the accuracy of snapping, especially to edges...
bool directed_graph
If set to true, the graph will be directed.
const string SERVER_ID
Indicates which graph server(s) to send the request to.
IList< string > restrictions
Restrictions represent a method of informing the graph solver which edges and/or nodes should be igno...