7 using System.Collections.Generic;
35 public const string TRUE =
"true";
36 public const string FALSE =
"false";
68 public const string TRUE =
"true";
69 public const string FALSE =
"false";
224 public IList<string>
nodes {
get;
set; } =
new List<string>();
238 public IList<string>
edges {
get;
set; } =
new List<string>();
252 public IList<string>
weights {
get;
set; } =
new List<string>();
447 public IDictionary<string, string>
options {
get;
set; } =
new Dictionary<string, string>();
706 IDictionary<string, string>
options =
null)
710 this.nodes =
nodes ??
new List<string>();
711 this.edges =
edges ??
new List<string>();
712 this.weights =
weights ??
new List<string>();
735 public IList<long>
edges_ids {
get;
set; } =
new List<long>();
738 public IDictionary<string, string>
info {
get;
set; } =
new Dictionary<string, string>();
const string EMBEDDING_TABLE
If table exists (should be generated by the match/graph match_embedding solver), the vector embedding...
bool result
Indicates a successful creation on all servers.
string graph_name
Name of the graph resource to generate.
const string ADD_TABLE_MONITOR
Adds a table monitor to every table used in the creation of the graph; this table monitor will trigge...
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.
A set of results returned by Kinetica.createGraph.
long num_edges
Total number of edges created.
KineticaData - class to help with Avro Encoding for Kinetica
const string GRAPH_TABLE
If specified, the created graph is also created as a table with the given name, in [schema_name.
const string IS_PARTITIONED
long num_nodes
Total number of nodes created.
IList< string > restrictions
Restrictions represent a method of informing the graph solver which edges and/or nodes should be igno...
IList< string > weights
Weights represent a method of informing the graph solver of the cost of including a given edge in a s...
IDictionary< string, string > options
Optional parameters.
IDictionary< string, string > info
Additional information.
IList< string > nodes
Nodes represent fundamental topological units of a graph.
const string ALLOW_MULTIPLE_EDGES
Multigraph choice; allowing multiple edges with the same node pairs if set to true,...
const string LABEL_DELIMITER
If provided the label string will be split according to this delimiter and each sub-string will be ap...
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< long > edges_ids
[Deprecated] Edges given as pairs of node indices.
const string SERVER_ID
Indicates which graph server(s) to send the request to.
const string RECREATE
If set to TRUE and the graph (using graph_name) already exists, the graph is deleted and recreated.
const string USE_RTREE
Use an range tree structure to accelerate and improve the accuracy of snapping, especially to edges.
const string MERGE_TOLERANCE
If node geospatial positions are input (e.g., WKTPOINT, X, Y), determines the minimum separation allo...
const string ADD_TURNS
Adds dummy 'pillowed' edges around intersection nodes where there are more than three edges so that a...
CreateGraphRequest()
Constructs a CreateGraphRequest object with default parameters.
A set of parameters for Kinetica.createGraph.
A set of string constants for the parameter options.
bool directed_graph
If set to TRUE, the graph will be directed.
A set of string constants for the parameter directed_graph.
IList< string > edges
Edges represent the required fundamental topological unit of a graph that typically connect nodes.