pub struct SolveGraphRequest
pub graph_name: String,
pub weights_on_edges: Vec<String>,
pub restrictions: Vec<String>,
pub solver_type: String,
pub source_nodes: Vec<String>,
pub destination_nodes: Vec<String>,
pub solution_table: String,
pub options: HashMap<String, String>,
The request payload for the /solve/graph endpoint.
Solves an existing graph.
Fields
graph_name: StringName of the graph resource to solve.
weights_on_edges: Vec<String>Additional weights to apply to the edges of an existing graph. Weights must be specified using identifiers; identifiers are grouped as combinations. Identifiers can be used with existing column names, e.g., ‘table.column AS WEIGHTS_EDGE_ID’, expressions, e.g., ‘ST_LENGTH(wkt) AS WEIGHTS_VALUESPECIFIED’, or constant values, e.g., ‘4, 15, 2 AS WEIGHTS_VALUESPECIFIED’. Any provided weights will be added (in the case of ‘WEIGHTS_VALUESPECIFIED’) to or multiplied with (in the case of ‘WEIGHTS_FACTORSPECIFIED’) the existing weight(s). If using constant values in an identifier combination, the number of values specified must match across the combination.
restrictions: Vec<String>Additional restrictions to apply to the nodes/edges of an existing graph. Restrictions must be specified using identifiers; identifiers are grouped as combinations. Identifiers can be used with existing column names, e.g., ‘table.column AS RESTRICTIONS_EDGE_ID’, expressions, e.g., ‘column/2 AS RESTRICTIONS_VALUECOMPARED’, or constant values, e.g., ‘0, 0, 0, 1 AS RESTRICTIONS_ONOFFCOMPARED’. If using constant values in an identifier combination, the number of values specified must match across the combination. If remove_previous_restrictions option is set to true, any provided restrictions will replace the existing restrictions. Otherwise, any provided restrictions will be added (in the case of ‘RESTRICTIONS_VALUECOMPARED’) to or replaced (in the case of ‘RESTRICTIONS_ONOFFCOMPARED’).
solver_type: StringThe type of solver to use for the graph.
source_nodes: Vec<String>It can be one of the nodal identifiers - e.g: ‘NODE_WKTPOINT’ for source nodes. For BACKHAUL_ROUTING, this list depicts the fixed assets.
destination_nodes: Vec<String>It can be one of the nodal identifiers - e.g: ‘NODE_WKTPOINT’ for destination (target) nodes. For BACKHAUL_ROUTING, this list depicts the remote assets.
solution_table: StringName of the table to store the solution, in [schema_name.]table_name format, using standard name resolution rules.
options: HashMap<String, String>Additional parameters.
Trait Implementations
impl Clone for SolveGraphRequest
fn clone(&self) -> SolveGraphRequest
fn clone_from(&mut self, source: &Self)
source. Read moreimpl Debug for SolveGraphRequest
impl Default for SolveGraphRequest
fn default() -> SolveGraphRequest
impl<‘de> Deserialize<‘de> for SolveGraphRequest
fn deserialize<__D>(__deserializer: __D) ->Result<Self, __D::Error>
where __D: Deserializer<‘de>,
impl KineticaRecord for SolveGraphRequest
fn avro_schema(&self) -> &‘static str
fn use_compression() -> bool
KineticaOptions::use_snappy enabled. Read more