Skip to main content

​
◆ repartitionGraph() [1/4]

RepartitionGraphResponse gpudb::GPUdb::repartitionGraph (const RepartitionGraphRequest &request_) const

Rebalances an existing partitioned graph.

IMPORTANT: It’s highly recommended that you review the Graphs and Solvers concepts documentation, the Graph REST Tutorial, and/or some graph examples before using this endpoint.

Parameters
[in]request_Request object containing the parameters for the operation.
Returns
Response object containing the result of the operation.

​
◆ repartitionGraph() [2/4]

RepartitionGraphResponse & gpudb::GPUdb::repartitionGraph (const RepartitionGraphRequest &request_,
RepartitionGraphResponse &response_ ) const

Rebalances an existing partitioned graph.

IMPORTANT: It’s highly recommended that you review the Graphs and Solvers concepts documentation, the Graph REST Tutorial, and/or some graph examples before using this endpoint.

Parameters
[in]request_Request object containing the parameters for the operation.
[out]response_Response object containing the results of the operation.
Returns
Response object containing the result of the operation (initially passed in by reference).

​
◆ repartitionGraph() [3/4]

RepartitionGraphResponse gpudb::GPUdb::repartitionGraph (const std::string &graphName,
const std::map< std::string, std::string > &options ) const

Rebalances an existing partitioned graph.

IMPORTANT: It’s highly recommended that you review the Graphs and Solvers concepts documentation, the Graph REST Tutorial, and/or some graph examples before using this endpoint.

Parameters
[in]graphNameName of the graph resource to rebalance.
[in]optionsOptional parameters.
  • repartition_graph_new_graph_name: If a non-empty value is specified, the original graph will be kept (non-default behavior) and a new balanced graph will be created under this given name. When the value is empty (default), the generated ‘balanced’ graph will replace the original ‘unbalanced’ graph under the same graph name. The default value is ”.
  • repartition_graph_source_node: The distributed shortest path solve is run from this source node to all the nodes in the graph to create balanced partitions using the iso-distance levels of the solution. The source node is selected by the rebalance algorithm automatically (default case when the value is an empty string). Otherwise, the user specified node is used as the source. The default value is ”.
The default value is an empty map.
Returns
Response object containing the result of the operation.

​
◆ repartitionGraph() [4/4]

RepartitionGraphResponse & gpudb::GPUdb::repartitionGraph (const std::string &graphName,
const std::map< std::string, std::string > &options,
RepartitionGraphResponse &response_ ) const

Rebalances an existing partitioned graph.

IMPORTANT: It’s highly recommended that you review the Graphs and Solvers concepts documentation, the Graph REST Tutorial, and/or some graph examples before using this endpoint.

Parameters
[in]graphNameName of the graph resource to rebalance.
[in]optionsOptional parameters.
  • repartition_graph_new_graph_name: If a non-empty value is specified, the original graph will be kept (non-default behavior) and a new balanced graph will be created under this given name. When the value is empty (default), the generated ‘balanced’ graph will replace the original ‘unbalanced’ graph under the same graph name. The default value is ”.
  • repartition_graph_source_node: The distributed shortest path solve is run from this source node to all the nodes in the graph to create balanced partitions using the iso-distance levels of the solution. The source node is selected by the rebalance algorithm automatically (default case when the value is an empty string). Otherwise, the user specified node is used as the source. The default value is ”.
The default value is an empty map.
[out]response_Response object containing the results of the operation.
Returns
Response object containing the result of the operation (initially passed in by reference).