> ## 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 Solvers

| 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            |