java.lang.Object
- com.gpudb.protocol.MatchGraphRequest.SolveMethod

Enclosing class:

MatchGraphRequest
```
public static final class MatchGraphRequest.SolveMethod
extends Object
```
A set of string constants for the MatchGraphRequest parameter solveMethod.
The type of solver to use for graph matching.

Field Summary

Fields
Modifier and Type	Field	Description
`static String`	`MARKOV_CHAIN`	Matches `samplePoints` to the graph using the Hidden Markov Model (HMM)-based method, which conducts a range-tree closest-edge search to find the best combinations of possible road segments (`NUM_SEGMENTS`) for each sample point to create the best route.
`static String`	`MATCH_BATCH_SOLVES`	Matches `samplePoints` source and destination pairs for the shortest path solves in batch mode.
`static String`	`MATCH_CHARGING_STATIONS`	Matches an optimal path across a number of ev-charging stations between source and target locations.
`static String`	`MATCH_CLUSTERS`	Matches the graph nodes with a cluster index using Louvain clustering algorithm
`static String`	`MATCH_EMBEDDING`	Creates vector node embeddings
`static String`	`MATCH_ISOCHRONE`	Solves for isochrones for a set of input sources
`static String`	`MATCH_LOOPS`	Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels).
`static String`	`MATCH_OD_PAIRS`	Matches `samplePoints` to find the most probable path between origin and destination pairs with cost constraints.
`static String`	`MATCH_PATTERN`	Matches a pattern in the graph
`static String`	`MATCH_PICKUP_DROPOFF`	Matches the pickups and dropoffs by optimizing the total trip costs
`static String`	`MATCH_SIMILARITY`	Matches the intersection set(s) by computing the Jaccard similarity score between node pairs.
`static String`	`MATCH_SUPPLY_DEMAND`	Matches `samplePoints` to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot.

Method Summary
- Methods inherited from class java.lang.Object
  clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - MARKOV_CHAIN
```
public static final String MARKOV_CHAIN
```
    Matches samplePoints to the graph using the Hidden Markov Model (HMM)-based method, which conducts a range-tree closest-edge search to find the best combinations of possible road segments (NUM_SEGMENTS) for each sample point to create the best route. The route is secured one point at a time while looking ahead CHAIN_WIDTH number of points, so the prediction is corrected after each point. This solution type is the most accurate but also the most computationally intensive. Related options: NUM_SEGMENTS and CHAIN_WIDTH.
    
    See Also:
    
    Constant Field Values
  - MATCH_OD_PAIRS
```
public static final String MATCH_OD_PAIRS
```
    Matches samplePoints to find the most probable path between origin and destination pairs with cost constraints.
    
    See Also:
    
    Constant Field Values
  - MATCH_SUPPLY_DEMAND
```
public static final String MATCH_SUPPLY_DEMAND
```
    Matches samplePoints to optimize scheduling multiple supplies (trucks) with varying sizes to varying demand sites with varying capacities per depot. Related options: PARTIAL_LOADING and MAX_COMBINATIONS.
    
    See Also:
    
    Constant Field Values
  - MATCH_BATCH_SOLVES
```
public static final String MATCH_BATCH_SOLVES
```
    Matches samplePoints source and destination pairs for the shortest path solves in batch mode.
    
    See Also:
    
    Constant Field Values
  - MATCH_LOOPS
```
public static final String MATCH_LOOPS
```
    Matches closed loops (Eulerian paths) originating and ending at each graph node within min and max hops (levels).
    
    See Also:
    
    Constant Field Values
  - MATCH_CHARGING_STATIONS
```
public static final String MATCH_CHARGING_STATIONS
```
    Matches an optimal path across a number of ev-charging stations between source and target locations.
    
    See Also:
    
    Constant Field Values
  - MATCH_SIMILARITY
```
public static final String MATCH_SIMILARITY
```
    Matches the intersection set(s) by computing the Jaccard similarity score between node pairs.
    
    See Also:
    
    Constant Field Values
  - MATCH_PICKUP_DROPOFF
```
public static final String MATCH_PICKUP_DROPOFF
```
    Matches the pickups and dropoffs by optimizing the total trip costs
    
    See Also:
    
    Constant Field Values
  - MATCH_CLUSTERS
```
public static final String MATCH_CLUSTERS
```
    Matches the graph nodes with a cluster index using Louvain clustering algorithm
    
    See Also:
    
    Constant Field Values
  - MATCH_PATTERN
```
public static final String MATCH_PATTERN
```
    Matches a pattern in the graph
    
    See Also:
    
    Constant Field Values
  - MATCH_EMBEDDING
```
public static final String MATCH_EMBEDDING
```
    Creates vector node embeddings
    
    See Also:
    
    Constant Field Values
  - MATCH_ISOCHRONE
```
public static final String MATCH_ISOCHRONE
```
    Solves for isochrones for a set of input sources
    
    See Also:
    
    Constant Field Values

Class MatchGraphRequest.SolveMethod

Field Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

MARKOV_CHAIN

MATCH_OD_PAIRS

MATCH_SUPPLY_DEMAND

MATCH_BATCH_SOLVES

MATCH_LOOPS

MATCH_CHARGING_STATIONS

MATCH_SIMILARITY

MATCH_PICKUP_DROPOFF

MATCH_CLUSTERS

MATCH_PATTERN

MATCH_EMBEDDING

MATCH_ISOCHRONE