> ## Documentation Index > Fetch the complete documentation index at: https://docs.kinetica.com/llms.txt > Use this file to discover all available pages before exploring further. # SOLVE_GRAPH Solves an existing [graph](/content/graph_solver/network_graph_solver) using one of the supported [solver types](/content/graph_solver/network_graph_solver#solvers). The `SOLVE GRAPH` function can be called either within a `SELECT` statement as a table function or within an `EXECUTE FUNCTION` call. ```sql Table Function Syntax theme={null} SELECT * FROM TABLE ( SOLVE_GRAPH ( GRAPH => '[.]', SOLVER_TYPE => '', SOURCE_NODES => ) | INPUT_TABLES(()[,...])>, [DESTINATION_NODES => ) | INPUT_TABLES((
)[,...])>,] [WEIGHTS_ON_EDGES => ) | INPUT_TABLES((
)[,...])>,] [RESTRICTIONS => ) | INPUT_TABLES((
)[,...])>,] [OPTIONS => KV_PAIRS('
)[,...])>, SOLUTION_TABLE => '[.]
', [DESTINATION_NODES => ) | INPUT_TABLES((
)[,...])>,] [WEIGHTS_ON_EDGES => ) | INPUT_TABLES((
)[,...])>,] [RESTRICTIONS => ) | INPUT_TABLES((
)[,...])>,] [OPTIONS => KV_PAIRS('
Solver Description CPU Parallel
ALLPATHS Determines all reasonable paths between a source and destination pair. X
BACKHAUL\_ROUTING Determines the optimal routes between remote asset *nodes* and fixed asset nodes. X
CENTRALITY Calculates 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. X
CLOSENESS Calculates the centrality closeness score per *node* as the sum of the inverse shortest path costs to all *nodes* in the graph. X
INVERSE\_SHORTEST\_PATH Determines the shortest path downstream using multiple technician routing. X
MULTIPLE\_ROUTING Calculates the shortest possible route between the *nodes* and returns to the origin *node* -- also known as the traveling salesman. X
PAGE\_RANK Calculates how connected the *nodes* are and determines which *nodes* are the most important. Weights are not required. X
PROBABILITY\_RANK Calculates the probability of a *node* being connected to another *node* using hidden Markov chains. X
SHORTEST\_PATH Determines the shortest path upstream between given source(s) and destination(s). X
STATS\_ALL Calculates graph statistics such as graph diameter, longest pairs, vertex valences, topology numbers, average and max cluster sizes, etc. X
The *node(s)* used as the origin point(s) for the solution specified using the SQL `INPUT_TABLE` or `INPUT_TABLES` function. The input can be either the name of a table with appropriately named columns; or a query, to use specific columns or other SQL features). Only applicable when using `EXECUTE FUNCTION` syntax. Name of the table to store the solution in `[schema_name.]table_name` format, using standard [name resolution rules](/content/sql/naming#sql-name-resolution) and meeting [table naming criteria](/content/sql/naming#sql-naming-criteria) The *node(s)* used as the destination point(s) for the solution specified using the SQL `INPUT_TABLE` or `INPUT_TABLES` function. The input can be either the name of a table with appropriately named columns; or a query, to use specific columns or other SQL features). Additional *weights* to apply to the *edges* of an existing graph specified using the SQL `INPUT_TABLE` or `INPUT_TABLES` function; review [Components and Identifiers](/content/graph_solver/network_graph_solver#identifiers) and [Identifier Combinations](/content/graph_solver/network_graph_solver#id-combos) for more information. The input can be either the name of a table with appropriately named columns; or a query, to use specific columns or other SQL features). Additional *restrictions* to apply to the *nodes*/*edges* of an existing graph specified using the SQL `INPUT_TABLE` or `INPUT_TABLES` function; review [Components and Identifiers](/content/graph_solver/network_graph_solver#identifiers) and [Identifier Combinations](/content/graph_solver/network_graph_solver#id-combos) for more information. The input can be either the name of a table with appropriately named columns; or a query, to use specific columns or other SQL features). Optional indicator that a comma-delimited list of connection option/value assignments will follow.
Option Description
astar\_radius For SHORTEST\_PATH, INVERSE\_SHORTEST\_PATH, ALLPATHS, and MULTIPLE\_ROUTING solvers, when solve\_heuristic is astar. The shortest path traversal front includes nodes only within this radius (kilometers) as it moves towards the target location. Default is 70.
convergence\_limit For PAGE\_RANK solver only; maximum percent relative threshold on the pagerank scores of each *node* between consecutive iterations to satisfy convergence. Default value is 1%.
intersection\_penalty This will add an additional weight over the edges labeled as intersection if the add\_turn option was invoked during graph creation. The default value is 0.0.
left\_turn\_penalty This will add an additional weight over the edges labeled as left\_turn if the add\_turn option was invoked during graph creation. The default value is 0.0.
max\_iterations For PAGE\_RANK solver only; maximum number of pagerank iterations for satisfying convergence. Default value is 100.
max\_num\_combinations For MULTIPLE\_ROUTING solver only. Sets the cap on the combinatorial sequence generated. If the default value (2000000) is overridden, it potentially speeds up the solver.
max\_runs For CENTRALITY solver only. Sets the maximum number of shortest path runs--maximum possible value is the number of *nodes* in the graph. Default of 0 enables this value to be auto-computed by the solver.
max\_solution\_radius For SHORTEST\_PATH, INVERSE\_SHORTEST\_PATH, & ALLPATHS solvers only. Sets the maximum solution cost radius, which ignores the DESTINATION\_NODES list and instead outputs the nodes within the radius sorted by ascending cost. If set to 0.0 (the default), the setting is ignored.
max\_solution\_targets For SHORTEST\_PATH, INVERSE\_SHORTEST\_PATH, & ALLPATHS solvers only. Sets the maximum number of solution targets, which ignores the DESTINATION\_NODES list and instead outputs no more than *n* number of nodes sorted by ascending cost where *n* is equal to the setting value. If set to 0 (the default), the setting is ignored.
min\_solution\_radius For SHORTEST\_PATH, INVERSE\_SHORTEST\_PATH, & ALLPATHS solvers only. Applicable when max\_solution\_radius is set. Sets the minimum solution cost radius, which ignores the DESTINATION\_NODES list and instead outputs the nodes within the radius sorted by ascending cost. If set to 0.0 (the default), the setting is ignored.
num\_best\_paths For MULTIPLE\_ROUTING solver only. Sets the number of shortest paths computed from each node. This is the heuristic criterion. If set to 0 (the default), the number will be determined automatically by the solver. Users may want to override this parameter to speed up the solver.
output\_clusters For STATS\_ALL solver only; the cluster index for each *node* will be inserted as an additional column in the output.
output\_edge\_path If set to true, concatenated edge IDs will be added as an EDGE\_PATH column to the solution table for each source and target pair in the SHORTEST\_PATH solves. The default value is false
output\_wkt\_path If set to true, WKT line segments will be added as a WKTROUTE column to the solution table for each source and target pair in SHORTEST\_PATH solves. The default value is false.
right\_turn\_penalty This will add an additional weight over the edges labeled as right\_turn if the add\_turn option was invoked during graph creation. The default value is 0.0.
server\_id Indicates which graph server(s) to send the request to. Default is to send to the server, amongst those containing the corresponding graph, that has the most computational bandwidth. For SHORTEST\_PATH solver, the input is split among the server containing the corresponding graph.
sharp\_turn\_penalty This will add an additional weight over the edges labeled as sharp\_turn or u\_turn if the add\_turn option was invoked during graph creation. The default value is 0.0.
solve\_heuristic The heuristic search criterion to use, only for geo graphs and SHORTEST\_PATH solves towards a single target. Specify astar to use an *A-STAR* heuristic. The default value is none.
uniform\_weights When specified, assigns the given value to all the edges in the graph. Note that weights provided using weights\_on\_edges will override this value.
## Examples Using the `EXECUTE FUNCTION` syntax necessitates the `SOLUTION_TABLE` parameter to store the solve results, where using the table function syntax will return the results directly. ```sql Table Function Example theme={null} SELECT * FROM TABLE ( SOLVE_GRAPH ( GRAPH => 'sample_graph', SOLVER_TYPE => 'SHORTEST_PATH', SOURCE_NODES => INPUT_TABLE(SELECT ST_GEOMFROMTEXT('POINT(0 0)') AS WKTPOINT), DESTINATION_NODES => INPUT_TABLE(SELECT ST_GEOMFROMTEXT('POINT(-5 -5)') AS WKTPOINT), OPTIONS => KV_PAIRS(output_edge_path = 'true') ) ) ``` ```sql EXECUTE FUNCTION Example theme={null} EXECUTE FUNCTION SOLVE_GRAPH ( GRAPH => 'sample_graph', SOLVER_TYPE => 'SHORTEST_PATH', SOURCE_NODES => INPUT_TABLE(SELECT ST_GEOMFROMTEXT('POINT(0 0)') AS WKTPOINT), DESTINATION_NODES => INPUT_TABLE(SELECT ST_GEOMFROMTEXT('POINT(-5 -5)') AS WKTPOINT), SOLUTION_TABLE => 'sample_graph_solved_shortest_path', OPTIONS => KV_PAIRS(output_edge_path = 'true') ) ``` This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.