A set of string constants for the parameter solver_type. 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...

const string	STATS_ALL = "STATS_ALL"
	Solves for graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc. More...

const string	CLOSENESS = "CLOSENESS"
	Solves for the centrality closeness score per node as the sum of the inverse shortest path costs to all nodes in the graph. More...

Detailed Description

A set of string constants for the parameter solver_type.

The type of solver to use for the graph.

Definition at line 31 of file SolveGraph.cs.

Member Data Documentation

◆ ALLPATHS

const string 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 should be >= shortest_path cost.

Definition at line 77 of file SolveGraph.cs.

◆ BACKHAUL_ROUTING

const string SolveGraphRequest.SolverType.BACKHAUL_ROUTING = "BACKHAUL_ROUTING"

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

Definition at line 70 of file SolveGraph.cs.

◆ CENTRALITY

const string 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 53 of file SolveGraph.cs.

◆ CLOSENESS

const string SolveGraphRequest.SolverType.CLOSENESS = "CLOSENESS"

Solves for the centrality closeness score per node as the sum of the inverse shortest path costs to all nodes in the graph.

Definition at line 87 of file SolveGraph.cs.

◆ INVERSE_SHORTEST_PATH

const string 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 66 of file SolveGraph.cs.

◆ MULTIPLE_ROUTING

const string 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 traveling salesman problem.

Definition at line 60 of file SolveGraph.cs.

◆ PAGE_RANK

const string 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 42 of file SolveGraph.cs.

◆ PROBABILITY_RANK

const string 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 47 of file SolveGraph.cs.

◆ SHORTEST_PATH

const string 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 36 of file SolveGraph.cs.

◆ STATS_ALL

const string SolveGraphRequest.SolverType.STATS_ALL = "STATS_ALL"

Solves for graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc.

Definition at line 82 of file SolveGraph.cs.

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

Kinetica/Protocol/SolveGraph.cs

Public Attributes