The type of solver to use for the graph. More...

Public Attributes
const string	SHORTEST_PATH = "SHORTEST_PATH"
	Solves for the optimal (shortest) path based on weights and restrictions from one source to destinations nodes. More...

const string	PAGE_RANK = "PAGE_RANK"
	Solves for the probability of each destination node being visited based on the links of the graph topology. More...

const string	PROBABILITY_RANK = "PROBABILITY_RANK"
	Solves for the transitional probability (Hidden Markov) for each node based on the weights (probability assigned over given edges). More...

const string	CENTRALITY = "CENTRALITY"
	Solves for the degree of a node to depict how many pairs of individuals that would have to go through the node to reach one another in the minimum number of hops. More...

const string	MULTIPLE_ROUTING = "MULTIPLE_ROUTING"
	Solves for finding the minimum cost cumulative path for a round-trip starting from the given source and visiting each given destination node once then returning to the source. More...

const string	INVERSE_SHORTEST_PATH = "INVERSE_SHORTEST_PATH"
	Solves for finding the optimal path cost for each destination node to route to the source node. More...

const string	BACKHAUL_ROUTING = "BACKHAUL_ROUTING"
	Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes. More...

const string	ALLPATHS = "ALLPATHS"
	Solves for paths that would give costs between max and min solution radia - Make sure to limit by the 'max_solution_targets' option. More...

Detailed Description

The type of solver to use for the graph.

Supported values:

SHORTEST_PATH: Solves for the optimal (shortest) path based on weights and restrictions from one source to destinations nodes. Also known as the Dijkstra solver.
PAGE_RANK: Solves for the probability of each destination node being visited based on the links of the graph topology. Weights are not required to use this solver.
PROBABILITY_RANK: Solves for the transitional probability (Hidden Markov) for each node based on the weights (probability assigned over given edges).
CENTRALITY: Solves for the degree of a node to depict how many pairs of individuals that would have to go through the node to reach one another in the minimum number of hops. Also known as betweenness.
MULTIPLE_ROUTING: Solves for finding the minimum cost cumulative path for a round-trip starting from the given source and visiting each given destination node once then returning to the source. Also known as the travelling salesman problem.
INVERSE_SHORTEST_PATH: Solves for finding the optimal path cost for each destination node to route to the source node. Also known as inverse Dijkstra or the service man routing problem.
BACKHAUL_ROUTING: Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes.
ALLPATHS: Solves for paths that would give costs between max and min solution radia - Make sure to limit by the 'max_solution_targets' option. Min cost shoudl be >= shortest_path cost.

The default value is SHORTEST_PATH. A set of string constants for the parameter solver_type.

Definition at line 102 of file SolveGraph.cs.

Member Data Documentation

const string kinetica.SolveGraphRequest.SolverType.ALLPATHS = "ALLPATHS"

Solves for paths that would give costs between max and min solution radia - Make sure to limit by the 'max_solution_targets' option.

Min cost shoudl be >= shortest_path cost.

Definition at line 145 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.BACKHAUL_ROUTING = "BACKHAUL_ROUTING"

Solves for optimal routes that connect remote asset nodes to the fixed (backbone) asset nodes.

Definition at line 139 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.CENTRALITY = "CENTRALITY"

Solves for the degree of a node to depict how many pairs of individuals that would have to go through the node to reach one another in the minimum number of hops.

Also known as betweenness.

Definition at line 124 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.INVERSE_SHORTEST_PATH = "INVERSE_SHORTEST_PATH"

Solves for finding the optimal path cost for each destination node to route to the source node.

Also known as inverse Dijkstra or the service man routing problem.

Definition at line 135 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.MULTIPLE_ROUTING = "MULTIPLE_ROUTING"

Solves for finding the minimum cost cumulative path for a round-trip starting from the given source and visiting each given destination node once then returning to the source.

Also known as the travelling salesman problem.

Definition at line 130 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.PAGE_RANK = "PAGE_RANK"

Solves for the probability of each destination node being visited based on the links of the graph topology.

Weights are not required to use this solver.

Definition at line 113 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.PROBABILITY_RANK = "PROBABILITY_RANK"

Solves for the transitional probability (Hidden Markov) for each node based on the weights (probability assigned over given edges).

Definition at line 118 of file SolveGraph.cs.

const string kinetica.SolveGraphRequest.SolverType.SHORTEST_PATH = "SHORTEST_PATH"

Solves for the optimal (shortest) path based on weights and restrictions from one source to destinations nodes.

Also known as the Dijkstra solver.

Definition at line 108 of file SolveGraph.cs.

The documentation for this struct was generated from the following file:

Kinetica/Protocol/SolveGraph.cs

Public Attributes

Detailed Description

Member Data Documentation